256 search results - page 3 / 52 » Approximation Algorithms for Hamming Clustering Problems |
93
Voted
IWANN
2005
Springer
15 years 8 months ago
2005
Springer
101
Voted
COLT
1999
Springer
15 years 7 months ago
1999
Springer
110
Voted
ICPR
2008
IEEE
16 years 4 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...
143
Voted
JCSS
2002
15 years 2 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...