2745 search results - page 4 / 549 » A fast algorithm for computing large Fibonacci numbers |
NIPS
2001
13 years 8 months ago
2001
In previous work on "transformed mixtures of Gaussians" and "transformed hidden Markov models", we showed how the EM algorithm in a discrete latent variable mo...
CSDA
2006
13 years 7 months ago
2006
A framework of penalized generalized linear models and tensor products of B-splines with roughness penalties allows effective smoothing of data in multidimensional arrays. A strai...
ARITH
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
ICS
2009
Tsinghua U.
13 years 12 months ago
2009
Tsinghua U.
