Sciweavers

237 search results - page 22 / 48
» Algorithms for Exponentiation in Finite Fields
Sort
View
GFKL
2007
Springer
184views Data Mining» more  GFKL 2007»
13 years 11 months ago
FSMTree: An Efficient Algorithm for Mining Frequent Temporal Patterns
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contai...
Steffen Kempe, Jochen Hipp, Rudolf Kruse
ASIACRYPT
2006
Springer
13 years 11 months ago
The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
Pierrick Gaudry, T. Houtmann, D. Kohel, Christophe...
ECAI
2010
Springer
13 years 8 months ago
The Dynamics of Multi-Agent Reinforcement Learning
Abstract. Infinite-horizon multi-agent control processes with nondeterminism and partial state knowledge have particularly interesting properties with respect to adaptive control, ...
Luke Dickens, Krysia Broda, Alessandra Russo
SACRYPT
2001
Springer
106views Cryptology» more  SACRYPT 2001»
14 years 1 days ago
Fast Normal Basis Multiplication Using General Purpose Processors
—For cryptographic applications, normal bases have received considerable attention, especially for hardware implementation. In this article, we consider fast software algorithms ...
Arash Reyhani-Masoleh, M. Anwarul Hasan
SODA
1992
ACM
90views Algorithms» more  SODA 1992»
13 years 8 months ago
Self-Testing Polynomial Functions Efficiently and Over Rational Domains
In this paper we give the first self-testers and checkers for polynomials over rational and integer domains. We also show significantly stronger bounds on the efficiency of a simp...
Ronitt Rubinfeld, Madhu Sudan