Sciweavers

570 search results - page 5 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
EWSN
2004
Springer
15 years 11 months ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...
TIT
2008
90views more  TIT 2008»
15 years 6 months ago
On Optimal Quantization Rules for Some Problems in Sequential Decentralized Detection
We consider the design of systems for sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the samp...
XuanLong Nguyen, Martin J. Wainwright, Michael I. ...
193
Voted
FOCS
2008
IEEE
16 years 25 days ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
FOCS
2010
IEEE
15 years 3 months ago
Minimum-Cost Network Design with (Dis)economies of Scale
Given a network, a set of demands and a cost function f(
Matthew Andrews, Spyridon Antonakopoulos, Lisa Zha...
141
Voted
ICDCS
2010
IEEE
15 years 10 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...