2040 search results - page 208 / 408 » On the Complexity of Error Explanation |
122
click to vote
ECCC
2010
15 years 4 months ago
2010
An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...
122
click to vote
FGCS
2008
15 years 4 months ago
2008
As distributed storage systems grow, the response time between detection and repair of the error becomes significant. Systems built on shared servers have additional complexity be...
132
Voted
CORR
2007
Springer
15 years 4 months ago
2007
Springer
— This paper introduces an expectation-maximization (EM) algorithm within a wavelet domain Bayesian framework for semi-blind channel estimation of multiband OFDM based UWB commun...
128
click to vote
CVIU
2007
15 years 4 months ago
2007
Most digital color cameras sample only one color at each spatial location, using a single sensor coupled with a color filter array (CFA). An interpolation step called demosaicing...
141
click to vote
SAC
2006
ACM
15 years 4 months ago
2006
ACM
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...