242 search results - page 9 / 49 » Optimized Fast Algorithms for the Quaternionic Fourier Trans... |
SIAMSC
2010
13 years 3 months ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We exhibit a canonical basis of eigenvectors for the discrete Fourier transform (DFT). The transition matrix from the standard basis to defines a novel transform which we call ...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we show how genetic programming (GP) can be used to evolve system-size-independent quantum algorithms, and present a human-competitive Quantum Fourier Transform (QF...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
APPML
2010
13 years 8 months ago
2010
Let Sn denote the symmetric group on {1, . . . , n} and Sn-1 the stabilizer subgroup of n. We derive algorithms for computing Fourier transforms of left and right Sn-1-invariant s...