2745 search results - page 413 / 549 » A fast algorithm for computing large Fibonacci numbers |
110
click to vote
ESA
2003
Springer
15 years 10 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
148
click to vote
ICDM
2002
IEEE
15 years 9 months ago
2002
IEEE
Mining association rules may generate a large numbers of rules making the results hard to analyze manually. Pasquier et al. have discussed the generation of GuiguesDuquenne–Luxe...
152
click to vote
CASES
2004
ACM
15 years 8 months ago
2004
ACM
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
129
click to vote
FPL
2008
Springer
15 years 6 months ago
2008
Springer
Today, quasi-Monte Carlo (QMC) methods are widely used in finance to price derivative securities. The QMC approach is popular because for many types of derivatives it yields an es...
107
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The stability of low-rank matrix reconstruction is investigated in this paper. The -constrained minimal singular value ( -CMSV) of the measurement operator is shown to determine t...