Demonstrating Polynomial Run-time Growth for Local Search Matching
International symposium, Computer vision ; 1995 ; Coral Gables; FL
01.01.1995
6 pages
Also known as ISCV '95. IEEE cat no 95TB100006
Aufsatz (Konferenz)
Englisch
© 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
SECURITY - Demonstrating compliance
Online Contents | 2004
Engineering Index Backfile | 1929