113 search results - page 9 / 23 » Fast algorithms for discrete polynomial transforms |
FPGA
2006
ACM
14 years 8 days ago
2006
ACM
This paper presents an equation-based resource utilization model for automatically generated discrete Fourier transform (DFT) soft core IPs. The parameterized DFT IP generator all...
STOC
2012
ACM
11 years 11 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...
SIAMIS
2008
13 years 8 months ago
2008
We propose, analyze and test an alternating minimization algorithm for recovering images from blurry and noisy observations with total variation (TV) regularization. This algorith...
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...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
This paper proposes a new affine registration algorithm
for matching two point sets in IR2 or IR3. The input point
sets are represented as probability density functions, using
e...