2745 search results - page 29 / 549 » A fast algorithm for computing large Fibonacci numbers |
137
click to vote
WDAG
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
117
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper we present a fast method for computing acoustic likelihoods that makes use of a Graphics Processing Unit (GPU). After enabling the GPU acceleration the main processo...
135
click to vote
ISM
2008
IEEE
15 years 9 months ago
2008
IEEE
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
122
click to vote
CHES
2000
Springer
15 years 7 months ago
2000
Springer
The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appear...
152
click to vote
PODC
2009
ACM
16 years 3 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...