Sciweavers

2297 search results - page 11 / 460
» A fast APRIORI implementation
Sort
View
ARITH
1993
IEEE
15 years 2 months ago
Fast implementations of RSA cryptography
We detail and analyse the critical techniques which may be combined in the design of fast hardware for RSA cryptography: chinese remainders, star chains, Hensel's odd divisio...
Mark Shand, Jean Vuillemin
73
Voted
IPPS
2000
IEEE
15 years 2 months ago
A Novel Superscalar Architecture for Fast DCT Implementation
This paper presents a new superscalar architecture for fast discrete cosine transform (DCT). Comparing with the general SIMD architecture, it speeds up the DCT computation by a fac...
Zhang Yong, Min Zhang
62
Voted
BMCBI
2007
115views more  BMCBI 2007»
14 years 10 months ago
A novel, fast, HMM-with-Duration implementation - for application with a new, pattern recognition informed, nanopore detector
Background: Hidden Markov Models (HMMs) provide an excellent means for structure identification and feature extraction on stochastic sequential data. An HMM-with-Duration (HMMwD) ...
Stephen Winters-Hilt, Carl Baribault
ISMM
2009
Springer
15 years 4 months ago
Fast Implementation of the Ultimate Opening
Abstract. We present an efficient implementation of the ultimate attribute opening operator. In this implementation, the ultimate opening is computed by processing the image maxtre...
Jonathan Fabrizio, Beatriz Marcotegui
ADBIS
2003
Springer
108views Database» more  ADBIS 2003»
15 years 3 months ago
Evaluation of Common Counting Method for Concurrent Data Mining Queries
Data mining queries are often submitted concurrently to the data mining system. The data mining system should take advantage of overlapping of the mined datasets. In this paper we ...
Marek Wojciechowski, Maciej Zakrzewicz