A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube

Published:2003 Issue: Volume: Page:313-328
ISSN:0937-5511
Container-title:Algorithms and Combinatorics
language:
Short-container-title:

Author:

Chakrabarti Amit,Chazelle Bernard,Gum Benjamin,Lvov Alexey

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-55566-4_14.pdf

Reference27 articles.

1. M. Ajtai. A lower bound for finding predecessors in Yao’s cell probe model. Combinatorica, 8:235–247, 1988.

2. S. Arya and D. M. Mount. Approximate nearest neighbor searching. In Proc. 4th Annu. ACM-SIAM Symp. Disc. Alg., pages 271–280, 1993.

3. S. Arya, D. M. Mount, and O. Narayan. Accounting for boundary effects in nearest-neighbor searching. Disc. Comput. Geom., 16(2):155–176, 1996.

4. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A.Wu. An optimal algorithm for approximate nearest neighbor searching. J. ACM, 45(6):891–923, 1998. Preliminary version in Proc. 5th Annu. ACM-SIAM Symp. Disc. Alg., pages 573–582, 1994.

5. O. Barkol and Y. Rabani. Tighter lower bounds for nearest neighbor search and related problems in the cell probe model. In Proc. 32nd Annu. ACM Symp. Theory Comput., pages 388–396, 2000.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Randomized Approximate Nearest Neighbor Search with Limited Adaptivity;Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures;2016-07-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP