5096 search results - page 312 / 1020 » Landscape of Clustering Algorithms |
182
click to vote
ICDCS
2006
IEEE
16 years 21 days 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...
170
click to vote
PPOPP
1999
ACM
15 years 11 months ago
1999
ACM
Writing parallel applications for computational grids is a challenging task. To achieve good performance, algorithms designed for local area networks must be adapted to the differ...
181
click to vote
DATAMINE
2006
15 years 6 months ago
2006
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
169
click to vote
JMLR
2010
15 years 1 months ago
2010
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
180
click to vote
ISAAC
2004
Springer
16 years 6 hour ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...