256 search results - page 3 / 52 » Approximation Algorithms for Hamming Clustering Problems |
STOC
1999
ACM
13 years 10 months ago
1999
ACM
IWANN
2005
Springer
13 years 11 months ago
2005
Springer
COLT
1999
Springer
13 years 10 months ago
1999
Springer
ICPR
2008
IEEE
14 years 7 months ago
2008
IEEE
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...
JCSS
2002
13 years 5 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...