Sciweavers

2745 search results - page 322 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
AAECC
2007
Springer
109views Algorithms» more  AAECC 2007»
16 years 10 days ago
The Tangent FFT
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
Daniel J. Bernstein
180
Voted
SCCC
1998
IEEE
15 years 10 months ago
Parallel Generation of Inverted Files for Distributed Text Collections
We present a scalable algorithm for the parallel computation of inverted files for large text collections. The algorithm takes into account an environment of a high bandwidth netw...
Berthier A. Ribeiro-Neto, Joao Paulo Kitajima, Gon...
LSSC
2005
Springer
15 years 11 months ago
Systolic Architecture for Adaptive Censoring CFAR PI Detector
A new parallel algorithm for signal processing and a parallel systolic architecture of a robust constant false alarm rate (CFAR) processor with post-detection integration and adap...
Ivan Garvanov, Christo A. Kabakchiev, Plamen Daska...
130
Voted
WWW
2005
ACM
16 years 6 months ago
Towards autonomic web-sites based on learning automata
Autonomics or self-reorganization becomes pertinent for websites serving a large number of users with highly varying workloads. An important component of self-adaptation is to mod...
Pradeep S, Chitra Ramachandran, Srinath Srinivasa
155
Voted
PDP
2008
IEEE
16 years 16 days ago
Distributed Sparse Spatial Selection Indexes
Searching for similar objects in metric-space databases can be efficiently solved by using index data structures. A number of alternative sequential indexes have been proposed in...
Veronica Gil Costa, Mauricio Marín