61 search results - page 5 / 13 » A Grouped Fast Fourier Transform Algorithm Design For Select... |
DOCENG
2006
ACM
14 years 2 months ago
2006
ACM
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
ISCAS
2006
IEEE
14 years 2 months ago
2006
IEEE
—In this paper, we propose a cost-effective and low-power 64-point fast Fourier transform (FFT)/inverse FFT (IFFT) architecture and chip adopting the retrenched 8-point FFT/IFFT ...
PVM
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
This paper proposes a method to recognize 3D object from probed range image under arbitrary pose by fast spherical correlation. First, all view EGIs under different viewpoints are...
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,...