2745 search results - page 72 / 549 » A fast algorithm for computing large Fibonacci numbers |
194
click to vote
VECPAR
2004
Springer
15 years 12 months ago
2004
Springer
Peer-to-peer (P2P) computing offers new opportunities for building highly distributed data systems. Unlike client-server computing, P2P can operate without central coordination and...
174
Voted
RT
1998
Springer
15 years 10 months ago
1998
Springer
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a "standard" hierarchi...
169
click to vote
PAMI
2010
15 years 5 months ago
2010
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
169
click to vote
ACL
2012
13 years 9 months ago
2012
We address the problem of learning the mapping between words and their possible pronunciations in terms of sub-word units. Most previous approaches have involved generative modeli...
174
click to vote
AAECC
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...