6 search results - page 2 / 2 » A note on adaptive group lasso |
CPM
2000
Springer
13 years 8 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...