Sciweavers

CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 4 months ago
Improved Approximation Guarantees for Sublinear-Time Fourier Algorithms
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...
M. A. Iwen
APPML
2010
112views more  APPML 2010»
13 years 4 months ago
Computing Fourier transforms and convolutions of Sn-1-invariant signals on Sn in time linear in n
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...
Michael Clausen, Ramakrishna Kakarala
NIPS
2003
13 years 5 months ago
Generalised Propagation for Fast Fourier Transforms with Partial or Missing Data
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 ...
Amos J. Storkey
ICASSP
2008
IEEE
13 years 10 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...
CISS
2008
IEEE
13 years 10 months ago
Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm
—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...
Mark A. Iwen, Craig V. Spencer
ICSE
2009
IEEE-ACM
13 years 11 months ago
Mining recurrent activities: Fourier analysis of change events
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...
Abram Hindle, Michael W. Godfrey, Richard C. Holt