1449 search results - page 255 / 290 » Self-Randomized Exponentiation Algorithms |
112
Voted
CADE
2008
Springer
16 years 2 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
129
click to vote
EDBT
2006
ACM
16 years 2 months ago
2006
ACM
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
99
Voted
DCC
2005
IEEE
16 years 2 months ago
2005
IEEE
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...
127
Voted
DCC
2001
IEEE
16 years 2 months ago
2001
IEEE
We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...
120
click to vote
PAKDD
2009
ACM
15 years 11 months ago
2009
ACM
Since mining frequent patterns from transactional databases involves an exponential mining space and generates a huge number of patterns, efficient discovery of user-interest-based...