Author:
Ciaccia Paolo,Patella Marco
Publisher
Springer International Publishing
Reference16 articles.
1. Arya, S., Mount, D.M., et al.: An optimal algorithm for approximate nearest neighbor searching. JACM 45(6), 891–923 (1998)
2. Berchtold, S., Böhm, C., et al.: A cost model for nearest neighbor search in high-dimensional data space. In: Proceedings of PODS 1997, Tucson, AZ, pp. 78–86 (1997)
3. Bennett, K.P., Fayyad, U.M., Geiger, D.: Density-based indexing for approximate nearest-neighbor queries. In: Proceedings of KDD 1999, San Diego, CA, pp. 233–243 (1999)
4. Bustos, B., Navarro, G.: Probabilistic proximity searching algorithms based on compact partitions. JDA 2(1), 115–134 (2004)
5. Chaudhuri, S., Ding, B., Kandula, S.: Approximate query processing: no silver bullet. In: Proceedings of SIGMOD 2017, Chicago, IL (2017, to appear)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献