2600 search results - page 8 / 520 » Clustering with or without the Approximation |
STOC
2002
ACM
14 years 8 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
JCP
2006
2006
Reliable Partial Replication of Contents in Web Clusters: Getting Storage without losing Reliability
13 years 7 months ago
Traditionally, distributed Web servers have used two strategies for allocating files on server nodes: full replication and full distribution. While full replication provides a high...
JMLR
2010
13 years 2 months ago
2010
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...
COMBINATORICA
2010
13 years 5 months ago
2010