388 search results - page 18 / 78 » Convergence Properties of the K-Means Algorithms |
88
Voted
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
Graph alliances are recently developed global properties of any symmetric graph. Our purpose in the present paper is to design self-stabilizing fault tolerant distributed algorith...
NIPS
2003
15 years 1 months ago
2003
Belief propagation on cyclic graphs is an efficient algorithm for computing approximate marginal probability distributions over single nodes and neighboring nodes in the graph. I...
104
click to vote
AUTOMATICA
2002
14 years 11 months ago
2002
- In the general case of non-uniformly spaced frequency domain data and/or arbitrarily colored disturbing noise, the frequency domain subspace identification algorithms described i...
102
click to vote
MOR
2010
14 years 10 months ago
2010
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
CEE
2005
14 years 11 months ago
2005
In this paper, we first propose a new continuous action-set learning automaton and theoretically study its convergence properties and show that it converges to the optimal action....