111 search results - page 16 / 23 » The Complexity of Local List Decoding |
98
Voted
CORR
2007
Springer
15 years 11 days ago
2007
Springer
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
129
Voted
BMCBI
2010
15 years 16 days ago
2010
Background: While multiple alignment is the first step of usual classification schemes for biological sequences, alignment-free methods are being increasingly used as alternatives...
119
Voted
ICIP
2001
IEEE
16 years 2 months ago
2001
IEEE
In standard predictive video coders, intra-mode coding of macroblocks (MBs) provides packet loss resilience, at the cost of reduced compression efficiency. Conventional mode selec...
111
click to vote
STOC
2004
ACM
16 years 21 days ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
113
Voted
STOC
2003
ACM
16 years 21 days ago
2003
ACM
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...