716 search results - page 26 / 144 » Algorithmic Issues in Coding Theory |
138
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
231
click to vote
ICDE
2003
IEEE
16 years 3 months ago
2003
IEEE
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...
145
click to vote
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
116
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
163
click to vote
TIP
2008
15 years 2 months ago
2008
Abstract--Hyperspectral images present some specific characteristics that should be used by an efficient compression system. In compression, wavelets have shown a good adaptability...