Revisiting kd-tree for Nearest Neighbor Search
Authors:
Open Access
- 25 July 2019
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1378-1388
Abstract
No abstract availableThis publication has 28 references indexed in Scilit:
- LSH vs Randomized Partition Trees: Which One to Use for Nearest Neighbor Search?2014
- Approximate nearest neighbor algorithm based on navigable small world graphsInformation Systems, 2014
- Optimized Product QuantizationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2013
- Nearest-Neighbor Search on a Time Budget via Max-Margin Trees2012
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest NeighborsSIAM Journal on Computing, 2009
- Random projection trees and low dimensional manifolds2008
- Toeplitz and Circulant Matrices: A ReviewFoundations and Trends® in Communications and Information Theory, 2006
- A fast nearest-neighbor algorithm based on a principal axis search treeIEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
- New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (AESA)Pattern Recognition Letters, 1994
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977