4212 search results - page 1 / 843 » On Compressible Pairings and Their Computation |
AFRICACRYPT
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. In this paper we provide explicit formulæ to compute bilinear pairings in compressed form. We indicate families of curves where the proposed compressed computation metho...
ERSHOV
2006
Springer
13 years 8 months ago
2006
Springer
In the last years, new semistatic word-based byte-oriented compressors, such as Plain and Tagged Huffman and the Dense Codes, have been used to improve the efficiency of text retri...
DCC
2011
IEEE
12 years 11 months ago
2011
IEEE
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...
DCC
2011
IEEE
12 years 11 months ago
2011
IEEE
We present a new color image compression algorithm for RGB images. In our previous work [6], we presented a machine learning technique to derive a dictionary of orthonormal basis ...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper, we propose tree structure lossless coding, by which compression data are arranged in a tree structure. Current compression methods show improved performance by prod...