Sciweavers

1510 search results - page 40 / 302
» Upper Probabilities and Additivity
Sort
View
VTC
2008
IEEE
218views Communications» more  VTC 2008»
14 years 5 months ago
Performance Analysis of a System using Coordinate Interleaving and Constellation Rotation in Rayleigh Fading Channels
Abstract— Diversity can play an important role in the performance improvement of a communication system in fading channels. The achievable performance with signal space diversity...
Nauman F. Kiyani, Jos H. Weber, Alenka G. Zajic, G...
CORR
2008
Springer
189views Education» more  CORR 2008»
13 years 11 months ago
Algorithms for Dynamic Spectrum Access with Learning for Cognitive Radio
We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooperati...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli
TWC
2010
13 years 5 months ago
Random access transport capacity
Abstract--We develop a new metric for quantifying end-toend throughput in multihop wireless networks, which we term random access transport capacity, since the interference model p...
Jeffrey G. Andrews, Steven Weber, Marios Kountouri...
RANDOM
1998
Springer
14 years 3 months ago
"Balls into Bins" - A Simple and Tight Analysis
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
Martin Raab, Angelika Steger
FOCS
2009
IEEE
14 years 5 months ago
Higher Eigenvalues of Graphs
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...