Sciweavers

116 search results - page 13 / 24
» End-to-end performance of randomized distributed space-time ...
Sort
View
SIGSOFT
2007
ACM
16 years 5 months ago
Recommending random walks
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
Zachary M. Saul, Vladimir Filkov, Premkumar T. Dev...
ICC
2008
IEEE
125views Communications» more  ICC 2008»
15 years 10 months ago
Asymptotic Performance of DS-CDMA with Linear MMSE Receiver and Limited Feedback
Abstract—Signature quantization for reverse-link Direct Sequence (DS)- Code Division Multiple Access (CDMA) is considered. A receiver assumed to have perfect estimates of channel...
Wiroonsak Santipach
TWC
2008
133views more  TWC 2008»
15 years 4 months ago
Beam Selection Strategies for Orthogonal Random Beamforming in Sparse Networks
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
José López Vicario, Roberto Bosisio,...
ICDCS
2010
IEEE
15 years 8 months ago
LT Network Codes
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
Mary-Luc Champel, Kévin Huguenin, Anne-Mari...
CORR
2008
Springer
87views Education» more  CORR 2008»
15 years 4 months ago
The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
Tal Philosof, Ram Zamir