An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
- 3 April 2008
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Finding the neighborhood of a query in a dictionaryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A replacement for Voronoi diagrams of near linear sizePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Lower bounds for high dimensional nearest neighbor search and related problemsPublished by Association for Computing Machinery (ACM) ,1999
- Fuzzy queries in multimedia database systemsPublished by Association for Computing Machinery (ACM) ,1998
- Nearest neighbor queries in metric spacesPublished by Association for Computing Machinery (ACM) ,1997
- Locality-preserving hashing in multidimensional spacesPublished by Association for Computing Machinery (ACM) ,1997
- Query by image and video content: the QBIC systemComputer, 1995
- Indexing by latent semantic analysisJournal of the American Society for Information Science, 1990
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977
- Nearest neighbor pattern classificationIEEE Transactions on Information Theory, 1967