2745 search results - page 36 / 549 » A fast algorithm for computing large Fibonacci numbers |
164
Voted
BMCBI
2004
15 years 3 months ago
2004
Background: Parallel computing is frequently used to speed up computationally expensive tasks in Bioinformatics. Results: Herein, a parallel version of the multi-alignment program...
142
Voted
ARITH
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper introduces the Interval Logarithmic Number System (ILNS), in which the Logarithmic Number System (LNS) is used as the underlying number system for interval arithmetic. ...
137
click to vote
INFOVIS
2002
IEEE
15 years 8 months ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
148
click to vote
GRAPHICSINTERFACE
2009
15 years 1 months ago
2009
We present a simple method to render complex 3D models at interactive rates using real-time displacement mapping. We use an octree to decompose the 3D model into a set of height f...
124
click to vote
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...