63 search results - page 9 / 13 » Optimal Error Correction Against Computationally Bounded Noi... |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
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...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper, a new adaptive beamforming algorithm with joint robustness against covariance matrix uncertainty as well as steering vector mismatch is proposed. First, the theoret...
ICCV
2007
IEEE
14 years 2 months ago
2007
IEEE
in Proc. IEEE Int’l Conf. on Computer Vision (ICCV), October, 2007 Traditional Bayesian restoration methods depend heavily on the accuracy of underlying generative models. For t...