Sciweavers

2297 search results - page 59 / 460
» A fast APRIORI implementation
Sort
View
CARDIS
2008
Springer
105views Hardware» more  CARDIS 2008»
15 years 20 days ago
Fast Hash-Based Signatures on Constrained Devices
Digital signatures are one of the most important applications of microprocessor smart cards. The most widely used algorithms for digital signatures, RSA and ECDSA, depend on finite...
Sebastian Rohde, Thomas Eisenbarth, Erik Dahmen, J...
TSP
2008
98views more  TSP 2008»
14 years 10 months ago
Fast and Stable YAST Algorithm for Principal and Minor Subspace Tracking
This paper presents a new implementation of the YAST algorithm for principal and minor subspace tracking. YAST was initially derived from the Subspace Projection (SP) algorithm by ...
Roland Badeau, Gaël Richard, Bertrand David
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
14 years 1 months ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda
DSD
2007
IEEE
133views Hardware» more  DSD 2007»
15 years 5 months ago
A Serial Logarithmic Number System ALU
Serial arithmetic uses less hardware than parallel arithmetic. Serial floating point (FP) is slower than parallel FP. The Logarithmic Number System (LNS) simplifies operations, ...
Mark G. Arnold, Panagiotis D. Vouzis
ICIP
2004
IEEE
16 years 8 days ago
Shear-resize factorizations for fast multi-modal volume registration
Intensity-based methods work well for multi-modal image registration owing to their effectiveness and simplicity, but the computation for geometric transforms is a heavy load. To ...
Ying Chen, Pengwei Hao, Jian Yu