Adaptive Estimation for Approximate k-Nearest-Neighbor Computations

25 Feb 2019Daniel LeJeuneRichard G. BaraniukReinhard Heckel

Algorithms often carry out equally many computations for "easy" and "hard" problem instances. In particular, algorithms for finding nearest neighbors typically have the same running time regardless of the particular problem instance... (read more)

PDF Abstract

Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.