1941 search results - page 144 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
182
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
— We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k ≥ 2, we ...
159
click to vote
INFOCOM
2003
IEEE
16 years 8 days ago
2003
IEEE
—We present an information-theoretic framework for network management for recovery from nonergodic link failures. Building on recent work in the field of network coding, we desc...
182
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—The traditional formulation of the total value of information transfer is a multi-commodity flow problem. Here, each data source is seen as generating a commodity along a fixe...
226
click to vote
TMC
2010
15 years 1 months ago
2010
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...
195
click to vote
ICDCS
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...