2745 search results - page 96 / 549 » A fast algorithm for computing large Fibonacci numbers |
121
click to vote
CALC
2001
Springer
15 years 8 months ago
2001
Springer
We show that a positive definite integral ternary form can be reduced with O(M(s) log2 s) bit operations, where s is the binary encoding length of the form and M(s) is the bit-com...
129
Voted
VIS
2009
IEEE
16 years 4 months ago
2009
IEEE
Time and streak surfaces are ideal tools to illustrate time-varying vector fields since they directly appeal to the intuition about coherently moving particles. However, efficient ...
123
Voted
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
One of the earliest evolutionary computation algorithms, the genetic algorithm, is applied to the noise-free BBOB 2009 testbed. It is adapted to the continuous domain by increasin...
130
Voted
DAGSTUHL
2008
15 years 5 months ago
2008
Existing selfverifying solvers for dense linear (interval-)systems in C-XSC provide high accuracy, but are rather slow. A new set of solvers is presented, which are a lot faster th...
155
Voted
JMLR
2010
14 years 10 months ago
2010
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...