Succinct nearest neighbor search

42 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Singleton indexes for nearest neighbor search (2016, unknown): “Examples of approximate techniques are [27, 7, 13, 1, 16, 15].”
Comparative Analysis of Data Structures for Approximate Nearest Neighbor Search (2014, methodology): “Then, we associate these numPrefix closest pivots with the data point via an inverted file [23].”
Permutation Search Methods are Efficient, Yet Faster Search is Possible (2015, methodology): “NAPP is a neighborhood approximation index described in § 2 [40].”
Near neighbor searching with K nearest references (2015, methodology): “CNAPP simply uses simCNAPP ¼ jset ðûÞ \ setðv̂Þj, which takes values in ½0‥K .”
Approximate nearest neighbor algorithm based on navigable small world graphs (2014, methodology): “To get an idea about how the algorithm performs compared to previous k-NN algorithms, we have run a test from [25], a 10 million entries subset of CoPHiR collection [38].”