481 search results - page 31 / 97 » A Fast Program Generator of Fast Fourier Transforms |
104
click to vote
FOCM
2008
14 years 9 months ago
2008
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
TIT
2008
14 years 9 months ago
2008
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
IWANN
2009
Springer
15 years 4 months ago
2009
Springer
Controlling a biped robot with several degrees of freedom is a challenging task that takes the attention of several researchers in the fields of biology, physics, electronics, com...
DATE
2007
IEEE
15 years 4 months ago
2007
IEEE
In data dominated applications, loop transformations have a huge impact on the lifetime of array data and therefore on memory footprint. Since a locally optimal loop transformatio...
CBMS
1997
IEEE
15 years 1 months ago
1997
IEEE
This paper presents a full process of reconstruction of magnetic resonance images. The first step is to bring theacquired data fromthefrequencydomain,using a FastFourier Transform...