481 search results - page 10 / 97 » A Fast Program Generator of Fast Fourier Transforms |
FP
1989
15 years 3 months ago
1989
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
102
click to vote
ISSAC
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
ICESS
2004
Springer
15 years 5 months ago
2004
Springer
Recent work showed that staging and abstract interpretation can be used to derive correct families of combinatorial circuits, and illustrated this technique with an in-depth analys...
141
click to vote
STOC
2006
ACM
16 years 2 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 ...
RAS
2006
14 years 11 months ago
2006
We present a fast and efficient homing algorithm based on Fourier transformed panoramic images. By continuously comparing Fourier coefficients calculated from the current view wit...