Sciweavers

242 search results - page 7 / 49
» Fast computation of general Fourier Transforms on GPUS
Sort
View
IPPS
2007
IEEE
14 years 5 months ago
Optimizing the Fast Fourier Transform on a Multi-core Architecture
The rapid revolution in microprocessor chip architecture due to multicore technology is presenting unprecedented challenges to the application developers as well as system softwar...
Long Chen, Ziang Hu, Junmin Lin, Guang R. Gao
DAGM
2010
Springer
13 years 12 months ago
3D Object Detection Using a Fast Voxel-Wise Local Spherical Fourier Tensor Transformation
In this paper we present a novel approach for expanding spherical 3D-tensor fields of arbitrary order in terms of a tensor valued local Fourier basis. For an efficient implementati...
Henrik Skibbe, Marco Reisert, Thorsten Schmidt, Kl...
EC
1998
178views ECommerce» more  EC 1998»
13 years 10 months ago
The Simple Genetic Algorithm and the Walsh Transform: Part I, Theory
This paper is the first part of a two part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary repres...
Michael D. Vose, Alden H. Wright
ICASSP
2008
IEEE
14 years 5 months ago
Alternatives to the discrete fourier transform
It is well-known that the discrete Fourier transform (DFT) of a finite length discrete-time signal samples the discrete-time Fourier transform of the same signal at equidistant p...
Doru-Cristian Balcan, Aliaksei Sandryhaila, Jonath...
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
14 years 11 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle