Sciweavers

146 search results - page 2 / 30
» The Fast Generalized Gauss Transform
Sort
View
SYMMETRY
2010
124views more  SYMMETRY 2010»
13 years 5 days ago
SU(2) and SU(1, 1) Approaches to Phase Operators and Temporally Stable Phase States: Applications to Mutually Unbiased Bases and
: We propose a group-theoretical approach to the generalized oscillator algebra A recently investigated in J. Phys. A: Math. Theor. 2010, 43, 115303. The case 0 corresponds to th...
Natig M. Atakishiyev, Maurice R. Kibler, Kurt Bern...
CPHYSICS
2010
195views more  CPHYSICS 2010»
13 years 5 months ago
Fast spherical Bessel transform via fast Fourier transform and recurrence formula
We propose a new method for the numerical evaluation of the spherical Bessel transform. A formula is derived for the transform by using an integral representation of the spherical...
Masayuki Toyoda, Taisuke Ozaki
ICRA
2005
IEEE
129views Robotics» more  ICRA 2005»
13 years 11 months ago
Fast Computational Methods for Visually Guided Robots
— This paper proposes numerical algorithms for reducing the computational cost of semi-supervised and active learning procedures for visually guided mobile robots from O(M3 ) to ...
Maryam Mahdaviani, Nando de Freitas, Bob Fraser, F...
ICMCS
2008
IEEE
208views Multimedia» more  ICMCS 2008»
13 years 12 months ago
Fast computation of general Fourier Transforms on GPUS
We present an implementation of general FFTs for graphics processing units (GPUs). Unlike most existing GPU FFT implementations, we handle both complex and real data of any size t...
Brandon Lloyd, Chas Boyd, Naga K. Govindaraju
FP
1989
124views Formal Methods» more  FP 1989»
13 years 9 months ago
Deriving the Fast Fourier Algorithm by Calculation
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] ...
Geraint Jones