2745 search results - page 7 / 549 » A fast algorithm for computing large Fibonacci numbers |
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
ICPADS
1998
IEEE
13 years 11 months ago
1998
IEEE
: Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last alg...
ICRA
2005
IEEE
14 years 29 days ago
2005
IEEE
— We present a fast method for solving rigid body contact problems with friction, based on optimizations incorporated into Lemke’s algorithm for solving linear complementarity ...
CHI
1999
ACM
13 years 11 months ago
1999
ACM
The proliferation of multiple toolbars and UI widgets around the perimeter of application windows is an indication that the traditional GUI design of a single menubar is not suffi...
ICIP
1999
IEEE
14 years 9 months ago
1999
IEEE
The factorization method [1] is a feature-based approach to recover 3D rigid structure from motion. In [2], we extended their framework to recover a parametric description of the ...