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

First Page		Document Content
Date: 2014-11-28 11:05:21 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 Source URL: bioinfo.ict.ac.cn Download Document from Source Website File Size: 318,74 KB Share Document on Facebook

	Understanding Resolution Proofs through Herbrand’s Theorem‹ Stefan Hetzl1 , Tomer Libal2 , Martin Riener3 , and Mikheil Rukhaia4 1 Institute of Discrete Mathematics and Geometry, Vienna University of Technology DocID: 1xTCQ - View Document
	Sage Reference Manual: Combinatorial and Discrete Geometry Release 8.3 The Sage Development Team DocID: 1vfet - View Document
	Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis III: Algorithms for Discrete Convex Functions Kazuo Murota DocID: 1v6lO - View Document
	Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis I: Concepts of Discrete Convex Functions Kazuo Murota DocID: 1uq8J - View Document
	Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis II: Properties of Discrete Convex Functions Kazuo Murota DocID: 1uci8 - View Document