An efficient LSH indexing on discriminative short codes for high-dimensional nearest neighbors | 1 | 0.36 | 2019 |
Towards Secure Approximate ${k}$ -Nearest Neighbor Query Over Encrypted High-Dimensional Data. | 0 | 0.34 | 2018 |
Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data. | 1 | 0.35 | 2018 |
PQBF: I/O-Efficient Approximate Nearest Neighbor Search by Product Quantization. | 3 | 0.39 | 2017 |
SK-LSH: an efficient index structure for approximate nearest neighbor search | 32 | 0.91 | 2014 |
Near-Optimal Partial Linear Scan for Nearest Neighbor Search in High-Dimensional Space. | 2 | 0.37 | 2013 |