An Algorithm for Finding Best Matches in Logarithmic Expected Time
- 1 September 1977
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 3 (3), 209-226
- https://doi.org/10.1145/355744.355745
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Constructing optimal binary decision trees is NP-completeInformation Processing Letters, 1976
- An Algorithm for Finding Nearest NeighborsInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1975
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- A Branch and Bound Algorithm for Computing k-Nearest NeighborsInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1975
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974
- Optimization of k nearest neighbor density estimatesIEEE Transactions on Information Theory, 1973
- Some approaches to best-match file searchingCommunications of the ACM, 1973