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]
@inproceedings{MicoOV92,
title = {An algorithm for finding nearest neighbours in constant average time with a linear space complexity},
author = {Luisa Micó and José Oncina and Enrique Vidal 0001},
year = {1992},
doi = {10.1109/ICPR.1992.201840},
url = {https://doi.org/10.1109/ICPR.1992.201840},
researchr = {https://researchr.org/publication/MicoOV92},
cites = {0},
citedby = {0},
pages = {557-560},
booktitle = {11th IAPR International Conference on Pattern Recognition, ICPR 1992. Conference B: Pattern Recognition Methodology and Systems, The Hague, Netherlands, August 30-September 3, 1992},
publisher = {IEEE},
}