5595 search results - page 395 / 1119 » Approximation Algorithms for Clustering Problems |
152
click to vote
ICALP
2005
Springer
16 years 10 days ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
177
click to vote
WAOA
2005
Springer
16 years 8 days ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
194
click to vote
PPSN
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. Evolution Strategies, Evolutionary Algorithms based on Gaussian mutation and deterministic selection, are today considered the best choice as far as parameter optimizatio...
175
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. We consider the problem of clustering data into k 2 clusters given complex relations -- going beyond pairwise -- between the data points. The complex n-wise relations ar...
179
click to vote
KDD
1999
ACM
15 years 11 months ago
1999
ACM
Clustering is an important data mining problem. Most of the earlier work on clustering focussed on numeric attributes which have a natural ordering on their attribute values. Rece...