Approximate nearest neighbors: towards removing the curse of dimensionality

Piotr Indyk and Rajeev Motwani
Proc. 30th Symp. Theory of Computing, ACM, May 1998, pp. 604–613

Cites:

Fast hierarchical clustering and other applications of dynamic closest pairs

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine