Sciweavers

52 search results - page 2 / 11
» Performance of universal codes over infinite alphabets
Sort
View
TIT
2002
129views more  TIT 2002»
13 years 4 months ago
Arbitrary source models and Bayesian codebooks in rate-distortion theory
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
Ioannis Kontoyiannis, Junshan Zhang
GLOBECOM
2008
IEEE
13 years 11 months ago
Physical Layer Network Coding Schemes over Finite and Infinite Fields
: Direct application of network coding at the physical layer - physical layer network coding (PNC) - is a promising technique for two-way relay wireless networks. In a two-way rela...
Shengli Zhang, Soung Chang Liew, Lu Lu
TCOM
2008
105views more  TCOM 2008»
13 years 4 months ago
Source fidelity over fading channels: performance of erasure and scalable codes
We consider the transmission of a Gaussian source through a block fading channel. Assuming each block is decoded independently, the received distortion depends on the tradeoff betw...
Konstantinos E. Zachariadis, Michael L. Honig, Agg...
CVPR
2009
IEEE
14 years 12 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
TIT
2010
96views Education» more  TIT 2010»
12 years 11 months ago
Codes for asymmetric limited-magnitude errors with application to multilevel flash memories
Several physical effects that limit the reliability and performance of multilevel flash memories induce errors that have low magnitudes and are dominantly asymmetric. This paper st...
Yuval Cassuto, Moshe Schwartz, Vasken Bohossian, J...