242 search results - page 20 / 49 » Optimized Fast Algorithms for the Quaternionic Fourier Trans... |
MVA
1992
13 years 10 months ago
1992
In this study, we explore the domain of orthogonal transforms, in order to bring an understanding on the characterization of image features, with emphasis placed on the Karhunen-L...
ACIVS
2009
Springer
13 years 6 months ago
2009
Springer
Abstract. Gharavi-Alkhansari [1] proposed a full-search equivalent algorithm for speeding-up template matching based on Lp-norm distance measures. This algorithm performs a pruning...
JISE
2006
13 years 8 months ago
2006
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms. We first express a computational problem ...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
CANS
2011
Springer
12 years 8 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...