4212 search results - page 2 / 843 » On Compressible Pairings and Their Computation |
EUROCRYPT
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
WISE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper proposes to exploit content and usage information to rearrange an inverted index for a full-text IR system. The idea is to merge the entries of two frequently ...
DCC
2008
IEEE
14 years 4 months ago
2008
IEEE
Re-Pair is a dictionary-based compression method invented in 1999 by Larsson and Moffat. Although its practical performance has been established through experiments, the method ha...