Randomized Algorithms for Comparison-based Search

no code implementations • NeurIPS 2011 • Dominique Tschopp, Suhas Diggavi, Payam Delgosha, Soheil Mohajer

This paper addresses the problem of finding the nearest neighbor (or one of the $R$-nearest neighbors) of a query object $q$ in a database of $n$ objects, when we can only use a comparison oracle.

Object Retrieval