245 search results - page 9 / 49 » A Fast Fourier Transform Compiler |
APPML
2010
15 years 19 days 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...
151
Voted
STOC
2006
ACM
16 years 24 days ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
119
Voted
PACT
2009
Springer
15 years 7 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
100
Voted
HIPC
2007
Springer
15 years 6 months ago
2007
Springer
The Fast Fourier Transform (FFT) is of primary importance and a fundamental kernel in many computationally intensive scientific applications. In this paper we investigate its perf...
155
Voted
STOC
2012
ACM
13 years 2 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...