— 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...
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...
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...
We present a distributed scheme for initialization from atomic wavefunctions in ab initio molecular dynamics simulations. Good initial guesses for approximate wavefunctions are ve...
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...