2745 search results - page 67 / 549 » A fast algorithm for computing large Fibonacci numbers |
119
Voted
ICPP
1998
IEEE
15 years 7 months ago
1998
IEEE
The crew planning problem has been successfully solved on a loosely connected network of workstations (NOW) using advanced computational techniques and efficient communication pat...
100
click to vote
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
Distribution data naturally arise in countless domains, such as meteorology, biology, geology, industry and economics. However, relatively little attention has been paid to data m...
127
Voted
CHES
2007
Springer
15 years 9 months ago
2007
Springer
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
91
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Abstract—Fast multiplication can be achieved by using canonical signed digit (CSD) to speed-up computations. Conversion to CSD is needed when the multiplier is not known a priori...
105
Voted
IPL
1998
15 years 3 months ago
1998
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...