2745 search results - page 48 / 549 » A fast algorithm for computing large Fibonacci numbers |
120
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In this paper, a new fast Hartley transform (FHT) algorithmradix-22 suitable for pipeline implementation of the discrete Hartley transform (DHT) is presented. The proposed algorit...
143
click to vote
INFORMATICALT
2006
15 years 3 months ago
2006
We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applicati...
135
click to vote
JPDC
2008
15 years 3 months ago
2008
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout th...
163
click to vote
ISNN
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Nonlinear component analysis is a popular nonlinear feature extraction method. It generally uses eigen-decomposition technique to extract the principal components. But th...
135
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
—The notion of p-cycle (Preconfigured Protection Cycle) allows capacity efficient schemes to be designed for fast span protection in WDM mesh networks. Conventional p-cycle const...