1161 search results - page 61 / 233 » Approximation schemes for clustering problems |
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominat...
104
click to vote
MLDM
1999
Springer
15 years 4 months ago
1999
Springer
In large content-based image database applications, e cient information retrieval depends heavily on good indexing structures of the extracted features. While indexing techniques f...
TCS
2008
14 years 11 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
FOCS
2005
IEEE
15 years 5 months ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...