2297 search results - page 82 / 460 » A fast APRIORI implementation |
ISSAC
2009
Springer
15 years 5 months ago
2009
Springer
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
ICASSP
2008
IEEE
15 years 5 months ago
2008
IEEE
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...
ARITH
2007
IEEE
15 years 5 months ago
2007
IEEE
It is widely acknowledged that efficient modular multiplication is a key to high-performance implementation of public-key cryptography, be it classical RSA, Diffie-Hellman, or (hy...
108
click to vote
WEA
2007
Springer
15 years 5 months ago
2007
Springer
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to one million times faster than Dijkstra’s a...
ARITH
2005
IEEE
15 years 4 months ago
2005
IEEE
In a search for an algorithm to compute atan(x) which has both low latency and few floating point instructions, an interesting variant of familiar trigonometry formulas was disco...