Author:
Arya Sunil,Mount David M.,Vigneron Antoine,Xia Jian
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Arya, S., Malamatos, T.: Linear-size approximate Voronoi diagrams. In: Proc. 13th ACM-SIAM Sympos. Discrete Algorithms, pp. 147–155 (2002)
2. Arya, S., Malamatos, T., Mount, D.M.: Space-efficient approximate Voronoi diagrams. In: Proc. 34th Annu. ACM Sympos. Theory Comput., pp. 721–730 (2002)
3. Arya, S., Mount, D.M., Netanyahu, N., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. In: Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, pp. 573–582 (1994)
4. Assouad, P.: Plongements lipschitziens dans ℝ
n
. Bull. Soc. Math. France 111(4), 429–448 (1983)
5. Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: Proceedings of the 23rd International Conference on Machine Learning, pp. 97–104 (2006)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Pattern Matching in Doubling Spaces;Lecture Notes in Computer Science;2021
2. Multi-resolution sketches and locality sensitive hashing for fast trajectory processing;Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems;2018-11-06
3. Space-time tradeoffs for approximate nearest neighbor searching;Journal of the ACM;2009-11