2745 search results - page 6 / 549 » A fast algorithm for computing large Fibonacci numbers |
ANTS
1998
Springer
13 years 11 months ago
1998
Springer
We describe two techniques for fast multiple-precision evaluation of linearly convergent series, including power series and Ramanujan series. The computation time for N bits is O(...
DATE
2000
IEEE
13 years 11 months ago
2000
IEEE
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
NIPS
2008
13 years 8 months ago
2008
Multi-level hierarchical models provide an attractive framework for incorporating correlations induced in a response variable organized in a hierarchy. Model fitting is challengin...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
CATA
2000
13 years 8 months ago
2000
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...