13214 search results - page 331 / 2643 » Pseudorandomness for network algorithms |
169
click to vote
EOR
2008
15 years 6 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
210
click to vote
COMCOM
2011
15 years 1 months ago
2011
Internet topology mapping studies utilize large scale topology maps to analyze various characteristics of the Internet. IP alias resolution, the task of mapping IP addresses to th...
190
Voted
SECON
2008
IEEE
16 years 1 months ago
2008
IEEE
—We describe and evaluate a suite of distributed and computationally efficient algorithms for solving a class of convex optimization problems in wireless sensor networks. The pr...
210
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
Recently, cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing powerefficient ro...
197
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we present a family of algorithms for estimating stream weights for dynamic Bayesian networks with multiple observation streams. For the 2 stream case, we present a ...