Sciweavers

495 search results - page 74 / 99
» Capacity of Non-Malleable Codes
Sort
View
PIMRC
2008
IEEE
14 years 2 months ago
Performance of VoIP services over 3GPP WCDMA networks
We analyze the performance ofvoice services over 3GPP WCDMA Networks for Release 99 and Release 7 deployments. We show, by using simulations, that the system capacity of Release 7 ...
Ozcan Ozturk, Vinay Chande, Haitong Sun, Mehmet Ya...
GLOBECOM
2006
IEEE
14 years 1 months ago
Adaptive Precoding for Switching between Spatial Multiplexing and Diversity in MIMO OFDM with Transmit Antenna and Path Correlat
Abstract— The path and antenna correlations significantly degrade the system capacity in spatially-multiplexed multiple-input multiple-output (MIMO) orthogonal frequency-divisio...
Yu Fu, Chintha Tellambura, Witold A. Krzymien
KNINVI
2005
Springer
14 years 1 months ago
Representational Correspondence as a Basic Principle of Diagram Design
The timeworn claim that a picture is worth a thousand words is generally well-supported by empirical evidence, suggesting that diagrams and other information graphics can enhance h...
Christopher F. Chabris, Stephen M. Kosslyn
SYSTOR
2010
ACM
13 years 7 months ago
Empirical quantification of opportunities for content adaptation in web servers
A basic problem in the management of web servers is capacity planning: you want enough capacity to be able to serve peak loads, but not too much so as to avoid excessive costs. It...
Michael Gopshtein, Dror G. Feitelson
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 7 months ago
How to beat the sphere-packing bound with feedback
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless ...
Anant Sahai