Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Demonstrating Polynomial Run-time Growth for Local Search Matching



    Conference:

    International symposium, Computer vision ; 1995 ; Coral Gables; FL



    Publication date :

    1995-01-01


    Size :

    6 pages


    Remarks:

    Also known as ISCV '95. IEEE cat no 95TB100006



    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    Polynomial-Time Geometric Matching for Object Recognition

    Cass, T. A. | British Library Online Contents | 1997


    Memetic Algorithms: The Polynomial Local Search Complexity Theory Perspective

    Krasnogor, N. / Smith, J. | British Library Online Contents | 2008


    Demonstrating the Deterrent

    Emerald Group Publishing | 1961


    Local polynomial space–time descriptors for action classification

    Kihl, O. / Picard, D. / Gosselin, P. H. | British Library Online Contents | 2016


    Demonstrating exoplanet coronagraphs

    Cash, Webster | IEEE | 2012