Demonstrating Polynomial Run-time Growth for Local Search Matching
International symposium, Computer vision ; 1995 ; Coral Gables; FL
1995-01-01
6 pages
Also known as ISCV '95. IEEE cat no 95TB100006
Conference paper
English
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Polynomial-Time Geometric Matching for Object Recognition
British Library Online Contents | 1997
|Memetic Algorithms: The Polynomial Local Search Complexity Theory Perspective
British Library Online Contents | 2008
|Emerald Group Publishing | 1961
Local polynomial space–time descriptors for action classification
British Library Online Contents | 2016
|Demonstrating exoplanet coronagraphs
IEEE | 2012
|