866 search results - page 94 / 174 » Networked Slepian-Wolf: Theory and Algorithms |
150
click to vote
SIGECOM
2006
ACM
16 years 9 days ago
2006
ACM
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
151
click to vote
SAGT
2009
Springer
16 years 27 days ago
2009
Springer
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
158
click to vote
PODC
2005
ACM
15 years 12 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
201
click to vote
NIPS
2004
15 years 7 months ago
2004
We use unsupervised probabilistic machine learning ideas to try to explain the kinds of learning observed in real neurons, the goal being to connect abstract principles of self-or...
169
click to vote
SIGCOMM
2005
ACM
15 years 12 months ago
2005
ACM
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...