CORR
2010
Springer
13 years 4 months ago
2010
Springer
ABSTRACT. In this paper modified variants of the sparse Fourier transform algorithms from [14] are presented which improve on the approximation error bounds of the original algorit...
APPML
2010
13 years 4 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...
NIPS
2003
13 years 5 months ago
2003
Discrete Fourier transforms and other related Fourier methods have been practically implementable due to the fast Fourier transform (FFT). However there are many situations where ...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
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...
CISS
2008
IEEE
13 years 11 months ago
2008
IEEE
—This paper improves on the best-known runtime and measurement bounds for a recently proposed Deterministic sublinear-time Sparse Fourier Transform algorithm (hereafter called DS...
ICSE
2009
IEEE-ACM
13 years 11 months ago
2009
IEEE-ACM
Within the field of software repository mining, it is common practice to extract change-events from source control systems and then abstract these events to allow for different a...