Sciweavers

52 search results - page 7 / 11
» Decoding Turbo-Like Codes via Linear Programming
Sort
View
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 9 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
14 years 9 months ago
The price of privacy and the limits of LP decoding
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...
Cynthia Dwork, Frank McSherry, Kunal Talwar
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 3 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
VTC
2010
IEEE
172views Communications» more  VTC 2010»
13 years 7 months ago
Turbo Source Compression with Jointly Optimized Inner Irregular and Outer Irregular Codes
—In this paper, we present a near-lossless compression scheme for scalar-quantized source codec parameters based on iterative source-channel decoding (ISCD). The scheme is compar...
Laurent Schmalen, Peter Vary, Thorsten Clevorn, Ma...
ICIP
2008
IEEE
14 years 10 months ago
Face hallucination VIA sparse coding
In this paper, we address the problem of hallucinating a high resolution face given a low resolution input face. The problem is approached through sparse coding. To exploit the fa...
Jianchao Yang, Hao Tang, Yi Ma, Thomas S. Huang