Author:
Min Kerui,Kao Ming-Yang,Zhu Hong
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: 47th Annual Symposium on Foundations of Computer Science, pp. 459–468 (2006)
2. Nanopoulos, A., Theodoridis, Y., Manolopoulos, Y.: C2P: clustering based on closest pairs. In: 27th International Conference on Very Large Data Bases, pp. 331–340 (2001)
3. Coppersmith, D.: Rectangular matrix multiplication revisited. Journal of Complexity 13(1), 42–49 (1997)
4. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: 19th Annual ACM Symposium on Theory of Computing, pp. 1–6 (1987)
5. Greene, D., Parnas, M., Yao, F.: Multi-index hashing for information retrieval. In: 35th Annual Symposium on Foundations of Computer Science, pp. 722–731 (1994)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献