242 search results - page 1 / 49 » Optimized Fast Algorithms for the Quaternionic Fourier Trans... |
CAIP
1999
Springer
14 years 3 months ago
1999
Springer
Abstract. In this article, we deal with fast algorithms for the quaternionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hen...
ISAAC
2003
Springer
14 years 4 months ago
2003
Springer
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
STOC
2012
ACM
12 years 1 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...
CVPR
2008
IEEE
15 years 1 months ago
2008
IEEE
Salient areas in natural scenes are generally regarded as the candidates of attention focus in human eyes, which is the key stage in object detection. In computer vision, many mod...
NIPS
2003
14 years 16 days ago
2003
Discrete Fourier transforms and other related Fourier methods have been practically implementable due to the fast Fourier transform (FFT). However there are many situations where ...