Sciweavers

140 search results - page 4 / 28
» Inter-arrival times of message propagation on directed netwo...
Sort
View
UAI
2004
13 years 9 months ago
An Empirical Evaluation of Possible Variations of Lazy Propagation
As real-world Bayesian networks continue to grow larger and more complex, it is important to investigate the possibilities for improving the performance of existing algorithms of ...
Andres Madsen
AINA
2008
IEEE
14 years 2 months ago
LRTG: Scheduling Distributed Real-Time Tasks in Unreliable and Untrustworthy Systems
We consider scheduling distributed real-time tasks in unreliable (e.g., those with arbitrary node and network failures) and untrustworthy systems (e.g., those with Byzantine node ...
Kai Han, Binoy Ravindran, E. Douglas Jensen
ICML
2010
IEEE
13 years 9 months ago
Continuous-Time Belief Propagation
Many temporal processes can be naturally modeled as a stochastic system that evolves continuously over time. The representation language of continuous-time Bayesian networks allow...
Tal El-Hay, Ido Cohn, Nir Friedman, Raz Kupferman
ICPADS
2006
IEEE
14 years 1 months ago
Snap-Stabilizing PIF and Useless Computations
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In other words, a snap-stabilizing protocol is a self-stabilizing pr...
Alain Cournier, Stéphane Devismes, Vincent ...
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
13 years 5 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...