180 search results - page 30 / 36 » Minimum cost distributed source coding over a network |
MOBICOM
2003
ACM
14 years 28 days ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
In this paper, we study the problem of utility maximization in P2P systems, in which aggregate application-specific utilities are maximized by running distributed algorithms on P2...
WINE
2005
Springer
14 years 1 months ago
2005
Springer
We consider a class of networks where n agents need to send their traffic from a given source to a given destination over m identical, non-intersecting, and parallel links. For suc...
USENIX
2008
13 years 10 months ago
2008
Network emulation is valuable largely because of its ability to study applications running on real hosts and "somewhat real" networks. However, conservatively allocating...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...