5595 search results - page 27 / 1119 » Approximation Algorithms for Clustering Problems |
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
164
Voted
SIGMOD
2011
ACM
14 years 5 months ago
2011
ACM
Projective Clustering Ensembles (PCE) are a very recent advance in data clustering research which combines the two powerful tools of clustering ensembles and projective clustering...
120
click to vote
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
97
Voted
ICDM
2005
IEEE
15 years 8 months ago
2005
IEEE
We consider the problem of integrating a large number of interface schemas over the Deep Web, The scale of the problem and the diversity of the sources present serious challenges ...
128
click to vote
PAMI
2011
14 years 9 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...