1942 search results - page 72 / 389 » Speeding Up XTR |
158
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-S...
128
click to vote
IEICET
2008
15 years 6 months ago
2008
In this paper, we suggest that all pairings be in a group from an abstract angle. According to our results, we can define some new pairings with short Miller loops and hence speed ...
172
click to vote
IPL
2006
15 years 6 months ago
2006
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
110
click to vote
ENTCS
2007
15 years 6 months ago
2007
We report initial results on shortening propositional resolution refutation proofs. This has an application in speeding up deductive reconstruction (in theorem provers) of large p...
148
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
A variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. In a fix-free code any finite sequence of codewords can be decoded in both d...