233 search results - page 21 / 47 » Flows on Few Paths: Algorithms and Lower Bounds |
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
STOC
2001
ACM
14 years 8 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
Humans are articulated objects composed of non-rigid parts. We are interested in detecting and tracking human motions over various periods of time. In this paper we describe a met...