Sciweavers

423 search results - page 38 / 85
» Topology for Distributed Inference on Graphs
Sort
View
AUTOMATICA
2011
14 years 6 months ago
Distributed averaging on digital erasure networks
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
Ruggero Carli, Giacomo Como, Paolo Frasca, Federic...
AI
2010
Springer
14 years 12 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
ECAI
2010
Springer
15 years 29 days ago
Propagation of Opinions in Structural Graphs
Trust and reputation measures are crucial in distributed open systems where agents need to decide whom or what to choose. Existing work has mainly focused on the reputation of sing...
Nardine Osman, Carles Sierra, Jordi Sabater-Mir
INFOCOM
2005
IEEE
15 years 5 months ago
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
Dongsheng Li, Xicheng Lu, Jie Wu
CONEXT
2007
ACM
15 years 3 months ago
Internet routing resilience to failures: analysis and implications
Internet interdomain routing is policy-driven, and thus physical connectivity does not imply reachability. On average, routing on today's Internet works quite well, ensuring ...
Jian Wu, Ying Zhang, Zhuoqing Morley Mao, Kang G. ...