2745 search results - page 1 / 549 » A fast algorithm for computing large Fibonacci numbers |
IPL
2000
13 years 10 months ago
2000
We present a fast algorithm for computing large Fibonacci numbers. It is known that the product of Lucas numbers algorithm uses the fewest bit operations to compute the Fibonacci ...
TALG
2008
13 years 10 months ago
2008
The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in...
DATESO
2010
13 years 8 months ago
2010
Abstract. Data compression has been widely applied in many data processing areas. Compression methods use variable-length codes with the shorter codes assigned to symbols or groups...
STRINGOLOGY
2008
14 years 7 days ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
CGF
2008
13 years 11 months ago
2008
Metaballs are implicit surfaces widely used to model curved objects, represented by the isosurface of a density field defined by a set of points. Recently, the results of particle...