256 search results - page 4 / 52 » Approximation Algorithms for Hamming Clustering Problems |
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
108
click to vote
CATS
2006
14 years 11 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
SODA
2000
ACM
14 years 11 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
60
Voted
STOC
2002
ACM
15 years 9 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...
STOC
2003
ACM
15 years 9 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...