133 search results - page 1 / 27 » Simple and practical algorithm for sparse Fourier transform |
SODA
2012
ACM
12 years 12 months ago
2012
ACM
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
CORR
2010
Springer
14 years 9 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...
108
click to vote
EC
1998
14 years 9 months ago
1998
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...
FOCM
2010
14 years 8 months ago
2010
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
COLT
2010
Springer
14 years 7 months ago
2010
Springer
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...