Back to Results
First PageMeta Content
Mathematics / Statistics / Applied mathematics / Data mining / Search algorithms / Approximation algorithms / Discrete geometry / Nearest neighbor search / Numerical analysis / Hierarchical clustering / Cluster analysis / K-means clustering


Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair
Add to Reading List

Document Date: 2014-11-28 11:05:21

Open Document

File Size: 318,74 KB

Share Result on Facebook
UPDATE