Author:
Angiulli Fabrizio,Pizzuti Clara
Subject
Information Systems and Management
Reference34 articles.
1. Euclidean minimum spanning trees and bichromatic closest pairs;Agarwal;Discrete and Computational Geometry,1991
2. F. Angiulli, C. Pizzuti, Approximate k-closest-pairs with space filling curves, in: Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery (DAWAK’02), September 2002, pp. 124–134
3. F. Angiulli, C. Pizzuti, Top-k closest pairs join query: an approximate algorithm for large high dimensional data, in: Proceedings of the International Database Engineering and Applications Symposium (IDEAS’04), July 2004, pp. 124–134
4. J.L. Bentley, M.I. Shamos, Divide-and-conquer in multidimensional space, in: Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1996, pp. 220–230
5. C. Bohm, B. Braunmuller, M. Breunig, H. Kriegel, High performance clustering based on similarity join, in: Proceedings of the ACM International Conference on Information Knowledge Management (CIKM00), 2000, pp. 298–305
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献