Sciweavers

2297 search results - page 166 / 460
» A fast APRIORI implementation
Sort
View
ISCAS
2005
IEEE
124views Hardware» more  ISCAS 2005»
15 years 4 months ago
Parallel FFT computation with a CDMA-based network-on-chip
— Fast Fourier transform (FFT) algorithms are used in a wide variety of digital signal processing applications and many of these require high-performance parallel implementations...
Daewook Kim, Manho Kim, Gerald E. Sobelman
IBPRIA
2005
Springer
15 years 4 months ago
A Real-Time Gabor Primal Sketch for Visual Attention
We describe a fast algorithm for Gabor filtering, specially designed for multi-scale image representations. Our proposal is based on three facts: first, Gabor functions can be de...
Alexandre Bernardino, José Santos-Victor
SP
1998
IEEE
15 years 3 months ago
Stack and Queue Integrity on Hostile Platforms
When computationally intensive tasks have to be carried out on trusted, but limited, platforms such as smart cards, it becomes necessary to compensate for the limited resources me...
Premkumar T. Devanbu, Stuart G. Stubblebine
PC
2008
119views Management» more  PC 2008»
14 years 11 months ago
Atomic wavefunction initialization in ab initio
We present a distributed scheme for initialization from atomic wavefunctions in ab initio molecular dynamics simulations. Good initial guesses for approximate wavefunctions are ve...
Constantine Bekas, Alessandro Curioni, Wanda Andre...
SIAMSC
2008
113views more  SIAMSC 2008»
14 years 11 months ago
Statistical Condition Estimation for the Roots of Polynomials
This paper presents fast and reliable condition estimates for the roots of a real polynomial based on the method of statistical condition estimation (SCE) by Kenney and Laub. Using...
A. J. Laub, J. Xia