Sciweavers

2996 search results - page 286 / 600
» Numberings and Randomness
Sort
View
ICASSP
2010
IEEE
15 years 6 months ago
Feedback reduction in MIMO broadcast channels with LMMSE receivers
In this paper we analyze the performance of random beamforming schemes in a multi-user Gaussian broadcast channel. Each user will have N > 1 receive antennas allowing optimal c...
Matthew Pugh, Bhaskar D. Rao
ALGORITHMICA
2007
165views more  ALGORITHMICA 2007»
15 years 6 months ago
Motorcycle Graphs and Straight Skeletons
We present a new algorithm to compute motorcycle graphs. It runs in O(n √ n log n) time when n is the number of motorcycles. We give a new characterization of the straight skele...
Siu-Wing Cheng, Antoine Vigneron
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 6 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
CORR
2006
Springer
83views Education» more  CORR 2006»
15 years 6 months ago
Performance Analysis of CDMA Signature Optimization with Finite Rate Feedback
We analyze the performance of CDMA signature optimization with finite rate feedback. For a particular user, the receiver selects a signature vector from a signature codebook to avo...
Wei Dai, Youjian Liu, Brian Rider
JODL
2006
88views more  JODL 2006»
15 years 6 months ago
BroadScale: Efficient scaling of heterogeneous storage systems
Abstract Scalable storage architectures enable digital libraries and archives for the addition or removal of storage devices to increase storage capacity and bandwidth or retire ol...
Shu-Yuen Didi Yao, Cyrus Shahabi, Roger Zimmermann