5215 search results - page 336 / 1043 » Quantum clustering algorithms |
180
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 1 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...
160
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Abstract Given an n-point metric (P,d) and an integer k > 0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a r...
168
click to vote
GC
2004
Springer
16 years 15 hour ago
2004
Springer
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...