Sciweavers

242 search results - page 8 / 49
» Optimized Fast Algorithms for the Quaternionic Fourier Trans...
Sort
View
RAS
2006
105views more  RAS 2006»
13 years 8 months ago
Efficient visual homing based on Fourier transformed panoramic images
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...
Wolfgang Stürzl, Hanspeter A. Mallot
PPSC
1997
13 years 10 months ago
The Future Fast Fourier Transform?
It seems likely that improvements in arithmetic speed will continue to outpace advances in communication bandwidth. Furthermore, as more and more problems are working on huge datas...
Alan Edelman, Peter McCorquodale, Sivan Toledo
FOCS
2000
IEEE
14 years 1 months ago
Fast parallel circuits for the quantum Fourier transform
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
Richard Cleve, John Watrous
AHS
2006
IEEE
108views Hardware» more  AHS 2006»
13 years 10 months ago
A Multi-Objective Genetic Algorithm for On-Chip Real-time Adaptation of a Multi-Carrier Based Telecommunications Receiver
This paper presents a multi-objective algorithm for on-line adaptation of a multi-carrier code-division multiple access (MC-CDMA) receiver. A specially tailored Genetic Algorithm ...
Nasri Sulaiman, Ahmet T. Erdogan
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
14 years 9 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
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 ...
Nir Ailon, Bernard Chazelle