1388 search results - page 54 / 278 » Approximability of Robust Network Design |
OSDI
2002
ACM
14 years 8 months ago
2002
ACM
It is becoming increasingly common to construct network services using redundant resources geographically distributed across the Internet. Content Distribution Networks are a prim...
PODC
1990
ACM
13 years 11 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
SWAT
2010
Springer
13 years 6 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
OPODIS
2007
13 years 9 months ago
2007
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
Over the past few years, a number of approximate inference algorithms for networked data have been put forth. We empirically compare the performance of three of the popular algori...