1161 search results - page 8 / 233 » Approximation schemes for clustering problems |
EOR
2010
14 years 11 months ago
2010
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
100
click to vote
CPM
2000
Springer
15 years 4 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
IWANN
2005
Springer
15 years 5 months ago
2005
Springer
STOC
1999
ACM
15 years 4 months ago
1999
ACM
COLT
1999
Springer
15 years 4 months ago
1999
Springer