Sciweavers

242 search results - page 14 / 49
» Optimized Fast Algorithms for the Quaternionic Fourier Trans...
Sort
View
CORR
2007
Springer
79views Education» more  CORR 2007»
13 years 8 months ago
Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additi...
Xuancheng Shao, Steven G. Johnson
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 8 months ago
Efficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
John C. Bowman, Malcolm Roberts
SOFSEM
2007
Springer
14 years 2 months ago
Fast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Raphaël Clifford, Benjamin Sach
IPPS
2008
IEEE
14 years 3 months ago
Parallel option pricing with Fourier Space Time-stepping method on Graphics Processing Units
With the evolution of Graphics Processing Units (GPUs) into powerful and cost-efficient computing architectures, their range of application has expanded tremendously, especially i...
Vladimir Surkov
FOCS
1998
IEEE
14 years 1 months ago
Towards an Optimal Bit-Reversal Permutation Program
The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and rearrange data in the increasingly complicated memory hie...
Larry Carter, Kang Su Gatlin