847 search results - page 9 / 170 » Approximation algorithms for projective clustering |
CPM
2000
Springer
13 years 11 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...
RTCSA
2003
IEEE
14 years 20 days ago
2003
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
STOC
1999
ACM
13 years 11 months ago
1999
ACM
IPL
2008
13 years 7 months ago
2008
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters ...
IWANN
2005
Springer
14 years 27 days ago
2005
Springer
