Sciweavers

727 search results - page 84 / 146
» A Calculus of Bounded Capacities
Sort
View
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
14 years 1 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
ALGORITHMICA
2010
131views more  ALGORITHMICA 2010»
13 years 10 months ago
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
Yossi Azar, Uriel Feige, Daniel Glasner
CORR
2008
Springer
72views Education» more  CORR 2008»
13 years 10 months ago
Channels that Heat Up
This paper considers an additive noise channel where the time-k noise variance is a weighted sum of the squared magnitudes of the previous channel inputs plus a constant. This chan...
Tobias Koch, Amos Lapidoth, Paul-Peter Sotiriadis
CORR
2006
Springer
116views Education» more  CORR 2006»
13 years 10 months ago
On the Fading Paper Achievable Region of the Fading MIMO Broadcast Channel
We consider transmission over the ergodic fading multiple-antenna broadcast (MIMO-BC) channel with partial channel state information at the transmitter and full information at the ...
Amir Bennatan, David Burshtein
CORR
2006
Springer
126views Education» more  CORR 2006»
13 years 10 months ago
The Gaussian Multiple Access Wire-Tap Channel
We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intellige...
Ender Tekin, Aylin Yener