An algorithm for finding nearest neighbours in constant average time with a linear space complexity - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Luisa Micó, José Oncina, Enrique Vidal 0001. An algorithm for finding nearest neighbours in constant average time with a linear space complexity. In 11th IAPR International Conference on Pattern Recognition, ICPR 1992. Conference B: Pattern Recognition Methodology and Systems, The Hague, Netherlands, August 30-September 3, 1992. pages 557-560, IEEE, 1992. [doi]

This author has not been identified. Look up 'Luisa Micó' in GoogleThis author has not been identified. Look up 'José Oncina' in GoogleThis author has not been identified. Look up 'Enrique Vidal 0001' in Google

runs on WebDSL