103 search results - page 13 / 21 » Approximating rooted Steiner networks |
ICALP
2010
Springer
14 years 3 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
INFOCOM
2005
IEEE
14 years 4 months ago
2005
IEEE
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
TPDS
2008
13 years 10 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
UAI
1996
13 years 11 months ago
1996
We discuss Bayesian methods for learning Bayesian networks when data sets are incomplete. In particular, we examine asymptotic approximations for the marginal likelihood of incomp...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— This paper studies routing schemes and their distributed construction in limited wireless networks, such as sensor or mesh networks. We argue that the connectivity of s...