5595 search results - page 18 / 1119 » Approximation Algorithms for Clustering Problems |
107
click to vote
ICDCS
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
106
Voted
IPL
2007
14 years 11 months ago
2007
Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mi...
87
Voted
WADS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
93
Voted
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...
97
Voted
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...