Sciweavers

2270 search results - page 190 / 454
» On the distribution of eigenvalues of graphs
Sort
View
AI
2007
Springer
16 years 20 days ago
Adding Local Constraints to Bayesian Networks
When using Bayesian networks, practitioners often express constraints among variables by conditioning a common child node to induce the desired distribution. For example, an ‘orâ...
Mark Crowley, Brent Boerlage, David Poole
SIGMETRICS
2005
ACM
16 years 23 hour ago
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
Derek Leonard, Vivek Rai, Dmitri Loguinov
ISCAPDCS
2007
15 years 8 months ago
A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
Omar Kermia, Yves Sorel
TIT
2008
127views more  TIT 2008»
15 years 6 months ago
Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...
Mohsen Bayati, Devavrat Shah, Mayank Sharma
IJON
2010
189views more  IJON 2010»
15 years 5 months ago
Inference and parameter estimation on hierarchical belief networks for image segmentation
We introduce a new causal hierarchical belief network for image segmentation. Contrary to classical tree structured (or pyramidal) models, the factor graph of the network contains...
Christian Wolf, Gérald Gavin