Sciweavers

1033 search results - page 42 / 207
» The Relative History Heuristic
Sort
View
JMLR
2010
225views more  JMLR 2010»
14 years 6 months ago
Hartigan's Method: k-means Clustering without Voronoi
Hartigan's method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuri...
Matus Telgarsky, Andrea Vattani

Source Code
317views
16 years 17 days ago
Madagascar
Madagascar is an open-source software package for multidimensional data analysis and reproducible computational experiments. Its mission is to provide a convenient and powerful env...
CORR
2004
Springer
106views Education» more  CORR 2004»
14 years 11 months ago
Why Delannoy numbers?
This article is not a research paper, but a little note on the history of combinatorics: we present here a tentative short biography of Henri Delannoy, and a survey of his most no...
Cyril Banderier, Sylviane R. Schwer
CSB
2005
IEEE
141views Bioinformatics» more  CSB 2005»
15 years 5 months ago
Reconstructing Phylogenetic Networks Using Maximum Parsimony
Phylogenies—the evolutionary histories of groups of organisms—are one of the most widely used tools throughout the life sciences, as well as objects of research within systema...
Luay Nakhleh, Guohua Jin, Fengmei Zhao, John M. Me...
ICDE
2008
IEEE
162views Database» more  ICDE 2008»
16 years 1 months ago
Adaptive Approximate Similarity Searching through Metric Social Networks
Exploiting the concepts of social networking represents a novel approach to the approximate similarity query processing. We present a metric social network where relations between...
Jan Sedmidubský, Pavel Zezula, Stanislav Ba...