13214 search results - page 86 / 2643 » Pseudorandomness for network algorithms |
175
click to vote
INFOCOM
2008
IEEE
16 years 24 days ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
166
click to vote
IDMS
1999
Springer
15 years 10 months ago
1999
Springer
: The design of adaptive video compression algorithms to support multimedia applications that can adapt to changing network conditions is currently being the subject of intense stu...
159
click to vote
ADHOCNOW
2008
Springer
15 years 7 months ago
2008
Springer
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
147
click to vote
WEA
2007
Springer
16 years 14 days ago
2007
Springer
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
159
click to vote
GLOBECOM
2007
IEEE
16 years 21 days ago
2007
IEEE
— In this paper we use an information flow model for placement of traffic sinks in a wireless sensor network. Our mathematical model translates a communication network composed...