1646 search results - page 30 / 330 » fast 2007 |
80
Voted
PR
2007
15 years 8 days ago
2007
109
click to vote
AMC
2006
15 years 26 days ago
2006
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication. Based on the double-base chain representation of scalar using...
135
Voted
CSREASAM
2009
15 years 1 months ago
2009
Tantra 1 is a novel Pseudorandom number generator (PRNG) design that provides a long sequence high quality pseudorandom numbers at very high rate both in software and hardware impl...
FEGC
2009
14 years 10 months ago
2009
We develop an efficient algorithm for detecting frequent patterns that occur in sequence databases under certain constraints. By combining the use of bit vector representations of ...
116
Voted
NIPS
2004
15 years 2 months ago
2004
The computation and memory required for kernel machines with N training samples is at least O(N2 ). Such a complexity is significant even for moderate size problems and is prohibi...