Sciweavers

4962 search results - page 14 / 993
» Connectivity in Sub-Poisson Networks
Sort
View
DAM
2002
120views more  DAM 2002»
14 years 11 months ago
Connectivity and fault-tolerance of hyperdigraphs
Directed hypergraphs are used to model networks whose nodes are connected by directed buses. We study in this paper two parameters related to the fault-tolerance of directed bus n...
Daniela Ferrero, Carles Padró
SIGMETRICS
2006
ACM
15 years 5 months ago
Robust network connectivity: when it's the big picture that matters
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
Enoch Peserico, Larry Rudolph
RSFDGRC
2005
Springer
208views Data Mining» more  RSFDGRC 2005»
15 years 5 months ago
On the Complexity of Probabilistic Inference in Singly Connected Bayesian Networks
Abstract. In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks,...
Dan Wu, Cory J. Butz
FOCS
2009
IEEE
15 years 6 months ago
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
Zeev Nutov
ICC
2008
IEEE
15 years 6 months ago
Sizes of Minimum Connected Dominating Sets of a Class of Wireless Sensor Networks
— We consider an important performance measure of wireless sensor networks, namely, the least number of nodes, N, required to facilitate routing between any pair of nodes, allowi...
Ji Li, Chuan Heng Foh, Lachlan L. H. Andrew, Moshe...