256 search results - page 11 / 52 » Approximation Algorithms for Hamming Clustering Problems |
106
click to vote
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
COCOON
2010
Springer
15 years 2 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
106
click to vote
TEC
2008
14 years 9 months ago
2008
In this paper, we propose an evolutionary approach to the design of output codes for multiclass pattern recognition problems. This approach has the advantage of taking into account...
112
click to vote
ICASSP
2010
IEEE
14 years 9 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...