Sciweavers

178 search results - page 4 / 36
» On the Implementation of a Fast Prime Generation Algorithm
Sort
View
76
Voted
WIA
2000
Springer
15 years 1 months ago
Fast Implementations of Automata Computations
Abstract. In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a paralle...
Anne Bergeron, Sylvie Hamel
86
Voted
NDSS
1999
IEEE
15 years 1 months ago
Experimenting with Shared Generation of RSA Keys
We describe an implementation of a distributed algorithm to generate a shared RSA key. At the end of the computation, an RSA modulus N = pq is publicly known. All servers involved...
Michael Malkin, Thomas D. Wu, Dan Boneh
FIMI
2003
88views Data Mining» more  FIMI 2003»
14 years 11 months ago
A fast APRIORI implementation
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...
Ferenc Bodon
78
Voted
ICCD
1997
IEEE
140views Hardware» more  ICCD 1997»
15 years 1 months ago
Parallel-Array Implementations of a Non-Restoring Square Root Algorithm
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...
Yamin Li, Wanming Chu
IJCAI
2001
14 years 11 months ago
Efficient Consequence Finding
We present an extensive experimental study of consequence-finding algorithms based on kernel resolution, using both a trie-based and a novel ZBDD-based implementation, which uses ...
Laurent Simon, Alvaro del Val