2297 search results - page 31 / 460 » A fast APRIORI implementation |
DAM
2007
14 years 10 months ago
2007
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
RECONFIG
2008
IEEE
15 years 4 months ago
2008
IEEE
– We have implemented in FPGA recently published class of public key algorithms – MQQ, that are based on quasigroup string transformations. Our implementation achieves decrypti...
ICCD
1997
IEEE
15 years 2 months ago
1997
IEEE
In this paper, we present a parallel-array implementation of a new non-restoring square root algorithm (PASQRT). The carry-save adder (CSA) is used in the parallel array. The PASQ...
80
Voted
PAMI
2010
14 years 8 months ago
2010
— This paper proposes a fast algorithm for Walsh Hadamard Transform on sliding windows which can be used to implement pattern matching most efficiently. The computational require...
76
Voted
VLSISP
2002
14 years 10 months ago
2002
3:2 counters and 4:2 compressors have been widely used for multiplier implementations. In this paper, a fast 5:3 compressor is derived for high-speed multiplier implementations. Th...