2745 search results - page 305 / 549 » A fast algorithm for computing large Fibonacci numbers |
139
click to vote
BIBE
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract—We consider the problem of aligning multiple protein sequences with the goal of maximizing the SP (Sum-of-Pairs) score, when the number of sequences is large. The QOMA (...
137
click to vote
HPDC
2007
IEEE
15 years 11 months ago
2007
IEEE
With the evolution of technology, Grids cannot be considered any more solely as a federation of a modest number of powerful cluster computers. Trends show that future Grids will i...
151
Voted
ICPADS
2008
IEEE
15 years 11 months ago
2008
IEEE
The use of good random numbers is essential to the integrity of many mission-critical systems. However, when such systems are replicated for Byzantine fault tolerance, a serious i...
153
click to vote
ISCI
2008
15 years 5 months ago
2008
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
141
click to vote
WEA
2009
Springer
15 years 12 months ago
2009
Springer
We present a cgal-based univariate algebraic kernel, which provides certi ed real-root isolation of univariate polynomials with integer coe cients and standard functionalities such...