41 search results - page 1 / 9 » Improved Smoothed Analysis of the k-Means Method |
CORR
2008
Springer
13 years 11 months ago
2008
Springer
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...
ISAAC
2009
Springer
14 years 5 months ago
2009
Springer
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
ISQED
2006
IEEE
14 years 5 months ago
2006
IEEE
The continuing VLSI technology scaling leads to increasingly significant power supply fluctuations, which need to be modeled accurately in circuit design and verification. Meanwhi...
BMCBI
2008
13 years 11 months ago
2008
Background: The hierarchical clustering tree (HCT) with a dendrogram [1] and the singular value decomposition (SVD) with a dimension-reduced representative map [2] are popular met...
IR
2008
13 years 11 months ago
2008
Abstract. Document length is widely recognized as an important factor for adjusting retrieval systems. Many models tend to favor the retrieval of either short or long documents and...