610 search results - page 28 / 122 » Fast Modular Reduction |
AINA
2003
IEEE
15 years 2 months ago
2003
IEEE
The multiplications of common multiplicands and exponentiations of large integers with a large modulus are the primary computation operations in several well-known public key cryp...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we present a fast method for computing acoustic likelihoods that makes use of a Graphics Processing Unit (GPU). After enabling the GPU acceleration the main processo...
104
click to vote
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
JUCS
2010
14 years 8 months ago
2010
: With the spreading of embedded and mobile devices, public-key cryptography has become an important feature for securing communication and protecting personal data. However, the c...
ICFP
1997
ACM
15 years 1 months ago
1997
ACM
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...