Sciweavers

128 search results - page 9 / 26
» The efficient computation of Fourier transforms on the symme...
Sort
View
IPPS
1999
IEEE
13 years 11 months ago
Shuffle Memory System
This paper proposes a new memory system called shuffle memory. The shuffle memory is a generalization of transposition memory that has been widely used in 2-D Discrete Cosine Tran...
Kichul Kim
QCQC
1998
Springer
173views Communications» more  QCQC 1998»
13 years 11 months ago
Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...
Amir Fijany, Colin P. Williams
CVPR
2010
IEEE
14 years 3 months ago
Fast Image Alignment in the Fourier Domain
In this paper we propose a framework for gradient descent image alignment in the Fourier domain. Specifically, we propose an extension to the classical Lucas & Kanade (LK) a...
Ahmed Ashraf, Simon Lucey, Tsuhan Chen
ICMCS
2005
IEEE
109views Multimedia» more  ICMCS 2005»
14 years 1 months ago
An Efficient Architecture for Lifting-Based Forward and Inverse Discrete Wavelet Transform
In this research, an architecture that performs both forward and inverse lifting-based discrete wavelet transform is proposed. The proposed architecture reduces the hardware requi...
S. Mayilavelane Aroutchelvame, Kaamran Raahemifar
JPDC
2008
135views more  JPDC 2008»
13 years 7 months ago
Parallel block tridiagonalization of real symmetric matrices
Two parallel block tridiagonalization algorithms and implementations for dense real symmetric matrices are presented. Block tridiagonalization is a critical pre-processing step for...
Yihua Bai, Robert C. Ward