Sciweavers

208 search results - page 25 / 42
» Optimal SINR-based Random Access
Sort
View
COLT
2007
Springer
14 years 2 months ago
Strategies for Prediction Under Imperfect Monitoring
Abstract. We propose simple randomized strategies for sequential prediction under imperfect monitoring, that is, when the forecaster does not have access to the past outcomes but r...
Gábor Lugosi, Shie Mannor, Gilles Stoltz
INFOCOM
2010
IEEE
13 years 6 months ago
Distributed Opportunistic Scheduling for Ad-Hoc Communications Under Delay Constraints
—With the convergence of multimedia applications and wireless communications, there is an urgent need for developing new scheduling algorithms to support real-time traffic with ...
Sheu-Sheu Tan, Dong Zheng, Junshan Zhang, James R....
ICIP
2007
IEEE
14 years 9 months ago
Analysis of the Decoding-Complexity of Compressed Image-Based Scene Representations
Interactive navigation in image-based scenes requires random access to the compressed reference image data. When using state of the art block-based hybrid video coding techniques,...
Ingo Bauermann, Eckehard G. Steinbach
ICC
2007
IEEE
197views Communications» more  ICC 2007»
14 years 2 months ago
A Distributed Scheduling Algorithm for Multiuser MIMO Systems with 1-bit SINR Feedback
—Opportunistic scheduling in random beamforming maximizes the sum-rate by allocating resources to the users with the best channel condition, thus leveraging on multiuser diversit...
Stefano Sorrentino, Umberto Spagnolini, Lino Moret...
SPAA
1995
ACM
13 years 11 months ago
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors
For years, the computation rate of processors has been much faster than the access rate of memory banks, and this divergence in speeds has been constantly increasing in recent yea...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias,...