Tradeoffs for nearest neighbors on the sphere

@article{Laarhoven2015TradeoffsFN,
  title={Tradeoffs for nearest neighbors on the sphere},
  author={Thijs Laarhoven},
  journal={CoRR},
  year={2015},
  volume={abs/1511.07527}
}
We consider tradeoffs between the query and update complexities for the (approximate) nearest neighbor problem on the sphere, extending the spherical filters recently introduced by [Becker–Ducas–Gama– Laarhoven, SODA’16] to sparse regimes and generalizing the scheme and analysis to account for different tradeoffs. In a nutshell, for the sparse regime the tradeoff between the query complexity nq and update complexity nu for data sets of size n can be summarized by the following equation in terms… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 4 times over the past 90 days. VIEW TWEETS
13 Citations
41 References
Similar Papers

Similar Papers

Loading similar papers…