Sciweavers

5115 search results - page 213 / 1023
» On Randomized Lanczos Algorithms
Sort
View
210
Voted
ICC
2011
IEEE
219views Communications» more  ICC 2011»
14 years 6 months ago
Deterministic Equivalents for the Performance Analysis of Isometric Random Precoded Systems
—We consider a general wireless channel model for different types of code-division multiple access (CDMA) and space-division multiple-access (SDMA) systems with isometric random ...
Jakob Hoydis, Romain Couillet, Mérouane Deb...
ICALP
2009
Springer
16 years 7 months ago
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
Sudipto Guha, Zhiyi Huang
NOSSDAV
2009
Springer
16 years 1 months ago
Probabilistic event resolution with the pairwise random protocol
Peer-to-peer distributed virtual environments (DVE's) distribute state tracking and state transitions. Many DVE's - such as online games - require ways to fairly determi...
John L. Miller, Jon Crowcroft
197
Voted
ICC
2007
IEEE
142views Communications» more  ICC 2007»
16 years 1 months ago
Turbo Codes Based Image Transmission for Channels with Both Random Errors and Packet Loss
Abstract— In this paper, we propose an unequal error protection (UEP) framework for progressive image transmission over wireless networks with both random errors and packet loss....
Lei Yao, Lei Cao
ICC
2007
IEEE
142views Communications» more  ICC 2007»
16 years 1 months ago
On MAC Scheduling and Packet Combination Strategies for Practical Random Network Coding
— The present paper investigates practical algorithms to efficiently exploit random network coding for data delivery in multi-hop wireless networks. In the past few years, a gre...
Elena Fasolo, Michele Rossi, Jörg Widmer, Mic...