Sciweavers

1056 search results - page 97 / 212
» Accelerated Shift-and-Add Algorithms
Sort
View
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
14 years 2 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
CCGRID
2011
IEEE
13 years 1 months ago
Small Discrete Fourier Transforms on GPUs
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
S. Mitra, A. Srinivasan
STACS
1992
Springer
14 years 2 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
3DIM
2007
IEEE
14 years 4 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
ICCAD
2006
IEEE
112views Hardware» more  ICCAD 2006»
14 years 7 months ago
A new RLC buffer insertion algorithm
Most existing buffering algorithms neglect the impact of inductance on circuit performance, which causes large error in circuit analysis and optimization. Even for the approaches...
Zhanyuan Jiang, Shiyan Hu, Jiang Hu, Zhuo Li, Weip...