4302 search results - page 31 / 861 » Index Pairs Algorithms |
PDP
2008
IEEE
14 years 2 months ago
2008
IEEE
Searching for similar objects in metric-space databases can be efficiently solved by using index data structures. A number of alternative sequential indexes have been proposed in...
DCC
2011
IEEE
13 years 2 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...
AFRICACRYPT
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We introduce the rank-pairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pair...
PAIRING
2007
Springer
14 years 1 months ago
2007
Springer
We provide the first explicit construction of genus 2 curves over finite fields whose Jacobians are ordinary, have large prime-order subgroups, and have small embedding degree. ...