2745 search results - page 383 / 549 » A fast algorithm for computing large Fibonacci numbers |
167
click to vote
WSCG
2004
15 years 6 months ago
2004
Even after more than two decades of input devices development, many people still find the interaction with computers an uncomfortable experience. Efforts should be made to adapt c...
127
Voted
SIAMSC
2008
15 years 4 months ago
2008
Abstract. In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on distributed memory machines. Such octrees a...
151
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
130
click to vote
JACM
2000
15 years 4 months ago
2000
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
122
click to vote
GLVLSI
2007
IEEE
15 years 11 months ago
2007
IEEE
LNS (logarithmic number system) arithmetic has the advantages of high-precision and high performance in complex function computation. However, the large hardware problem in LNS ad...