Sciweavers

1057 search results - page 56 / 212
» Accelerating the LSTRS Algorithm
Sort
View
CHES
2004
Springer
167views Cryptology» more  CHES 2004»
15 years 6 months ago
Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs
Strong public-key cryptography is often considered to be too computationally expensive for small devices if not accelerated by cryptographic hardware. We revisited this statement a...
Nils Gura, Arun Patel, Arvinderpal Wander, Hans Eb...
75
Voted
FPL
2009
Springer
78views Hardware» more  FPL 2009»
15 years 5 months ago
FPGA-accelerated Information Retrieval: High-efficiency document filtering
Power consumption in data centres is a growing issue as the cost of the power for computation and cooling has become dominant. An emerging challenge is the development of “envir...
Wim Vanderbauwhede, Leif Azzopardi, Mahmoud Moadel...
101
Voted
ECAL
2005
Springer
15 years 6 months ago
On the Mean Convergence Time of Multi-parent Genetic Algorithms Without Selection
This paper investigates genetic drift in multi-parent genetic algorithms (MPGAs). An exact model based on Markov chains is proposed to formulate the variation of gene frequency. Th...
Chuan-Kang Ting
FIMI
2004
134views Data Mining» more  FIMI 2004»
15 years 1 months ago
Recursion Pruning for the Apriori Algorithm
Implementations of the well-known Apriori algorithm for finding frequent item sets and associations rules usually rely on a doubly recursive scheme to count the subsets of a given...
Christian Borgelt
96
Voted
NETWORKS
2008
15 years 15 days ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...