Sciweavers

10146 search results - page 8 / 2030
» Fast FAST
Sort
View
JCSS
2010
105views more  JCSS 2010»
13 years 6 months ago
Fast convolution and Fast Fourier Transform under interval and fuzzy uncertainty
Convolution y(t) = a(t − s) · x(s) ds is one of the main techniques in digital signal processing. A straightforward computation of the convolution y(t) requires O(n2) steps, wh...
Guoqing Liu, Vladik Kreinovich

Publication
445views
15 years 4 months ago
Computational Study of Fast Methods For The Eikonal Equation
"A computational study of the Fast Marching and the Fast Sweeping methods for the Eikonal equation is given. It is shown that even though Fast Sweeping requires asymptotically...
Pierre A. Gremaud and Christopher M. Kuster
AAECC
1999
Springer
109views Algorithms» more  AAECC 1999»
14 years 1 days ago
A Fast Program Generator of Fast Fourier Transforms
Michael Clausen, Meinard Müller