12659 search results - page 207 / 2532 » The distributed breakout algorithms |
163
click to vote
PODC
2006
ACM
15 years 11 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
202
click to vote
RTCSA
1999
IEEE
15 years 9 months ago
1999
IEEE
Replication is a well-know fault-tolerance technique, and several replication strategies exist (e.g. active, passive, and semi-active replication). To be used in hard real-time sy...
132
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
139
click to vote
PC
2000
15 years 5 months ago
2000
Rapid advancements in acoustical beamforming techniques for array signal processing are producing algorithms with increased levels of computational complexity. Concomitantly, auto...
157
click to vote
PPL
2002
15 years 5 months ago
2002
We present new communication-efficient parallel dense linear solvers: a solver for triangular linear systems with multiple right-hand sides and an LU factorization algorithm. Thes...