Partially specified nearest neighbor searches using k-d trees
- 6 September 1982
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 15 (2) , 53-56
- https://doi.org/10.1016/0020-0190(82)90106-5
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Extended K-d Tree Database Organization: A Dynamic Multiattribute Clustering MethodIEEE Transactions on Software Engineering, 1981
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977
- Partial-Match Retrieval AlgorithmsSIAM Journal on Computing, 1976
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975