Sciweavers

5451 search results - page 184 / 1091
» Connectivity of a Gaussian network
Sort
View
ICALP
2010
Springer
15 years 11 months ago
Network Design via Core Detouring for Problems without a Core
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...
Fabrizio Grandoni, Thomas Rothvoß
SECON
2010
IEEE
15 years 4 months ago
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Efficient Approximations
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
Dejun Yang, Satyajayant Misra, Xi Fang, Guoliang X...
SAGT
2009
Springer
140views Game Theory» more  SAGT 2009»
16 years 1 months ago
Price of Stability in Survivable Network Design
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
Elliot Anshelevich, Bugra Caskurlu
ICASSP
2009
IEEE
16 years 1 months ago
Structured variational methods for distributed inference in wireless ad hoc and sensor networks
Abstract –In this paper, a variational message passing framework is proposed for Markov random fields, which is computationally more efficient and admits wider applicability comp...
Yanbing Zhang, Huaiyu Dai
TIT
2008
98views more  TIT 2008»
15 years 6 months ago
Multiuser Successive Refinement and Multiple Description Coding
We consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes...
Chao Tian, Jun Chen, Suhas N. Diggavi