233 search results - page 28 / 47 » Flows on Few Paths: Algorithms and Lower Bounds |
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—In this paper, we study the theory of collaborative upload bandwidth measurement in peer-to-peer environments. A host can use a bandwidth estimation probe to determine the bandw...
ISAAC
2001
Springer
14 years 5 days ago
2001
Springer
We consider the routing for a special type of communication requests, called a multicast, consisting of a fixed source and a multiset of destinations in a wavelength division mult...
JMLR
2010
13 years 2 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple pa...
RTS
2008
13 years 7 months ago
2008
There has been much recent interest in the use of the earliest-deadline-first (EDF) algorithm for scheduling soft real-time sporadic task systems on identical multiprocessors. In ...