Sciweavers

727 search results - page 62 / 146
» A Calculus of Bounded Capacities
Sort
View
POPL
2010
ACM
14 years 5 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
13 years 9 months ago
Maximum Flows on Disjoint Paths
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
Guyslain Naves, Nicolas Sonnerat, Adrian Vetta
ISITA
2010
13 years 5 months ago
An achievable rate of large block-fading MIMO systems with no CSI via successive decoding
Abstract--A Rayleigh block-fading multiple-input multipleoutput (MIMO) channel with channel state information (CSI) available neither to the transmitter nor to the receiver is cons...
Keigo Takeuchi, Ralf R. Müller, Mikko Vehkape...
ICASSP
2009
IEEE
14 years 2 months ago
Performance bounds of MIMO receivers in the presence of radio frequency interference
—Multi-input multi-output (MIMO) receivers have generally been designed and their communication performance analyzed under the assumption of additive Gaussian noise. Wireless tra...
Aditya Chopra, Kapil Gulati, Brian L. Evans, Keith...
SIGMETRICS
2008
ACM
106views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Performance bounds for peer-assisted live streaming
Peer-assisted streaming is a promising way for service providers to offer high-quality IPTV to consumers at reasonable cost. In peerassisted streaming, the peers exchange video ch...
Shao Liu, Rui Zhang-Shen, Wenjie Jiang, Jennifer R...