| Document Date: 1997-11-20 19:58:04
Open Document File Size: 318,74 KBShare Result on Facebook
City Irvine / Berlin / New York / / Company Xerox Corp. / Yahoo / The times / John Wiley & Sons / / / Facility University Lecture Ser. / / IndustryTerm closest-pair algorithms / spiral search / nearest-neighbor classification systems / subquadratic algorithm / Local search procedures / on-line closest pair problem / potential applications / range search techmay / symbolic algebra systems / 603e processor / naive algorithm / recent geometric applications / basis algorithm / dot product / minimum spanning tree algorithm / low space requirements algorithms / computing / hierarchical clustering algorithm / suboptimal solution / computer memory systems / nearest neighbor search / heuristic solutions / / Organization NH MC / National Science Foundation / NH FP / in∗ Department of Information and Computer Science / / Person Cheng / Lewis / II / Wallace / R. Agarwala / V / / Position author / Traveling Salesman / representative / general data sets / salesman / dean / / ProgrammingLanguage FP / TSP / C++ / / ProvinceOrState New York / California / / PublishedMedium Nucleic Acids Research / Theory of Computing / Lecture Notes in Computer Science / / Technology Semi-dynamic closest-pair algorithms / hierarchical clustering algorithm / low space requirements algorithms / Groebner basis algorithm / clustering algorithms / Buchberger algorithm / 200MHz PowerPC 603e processor / naive algorithm / caching / Gr¨obner basis algorithm / machine learning / 9.1 Algorithms / simulation / 603e processor / four algorithms / minimum spanning tree algorithm / / URL http /
SocialTag |
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