Finding $k$-closest-pairs efficiently for high dimensional data

Mario A. Lopez and Swanwa Liao
Proc. 12th Canad. Conf. Computational Geometry, Aug 2000
http://www.cs.unb.ca/conf/cccg/eProceedings/29.ps.gz

Cites:

[D. Eppstein publications] [Citation database] [Documents]
Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!