2745 search results - page 57 / 549 » A fast algorithm for computing large Fibonacci numbers |
184
click to vote
CPM
1998
Springer
15 years 7 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
141
Voted
ARITH
2001
IEEE
15 years 7 months ago
2001
IEEE
A recently introduced double-base number representation has proved to be successful in optimizing the performance of several algorithms in cryptography and digital signal processi...
144
click to vote
DAC
2006
ACM
2006
ACM
A fast on-chip decoupling capacitance budgeting algorithm using macromodeling and linear programming
15 years 9 months ago
We propose a novel and efficient charge-based decoupling capacitance budgeting algorithm. Our method uses the macromodeling technique and effective radius of decoupling capacitan...
138
Voted
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
We have developed a new algorithm that allows the exhaustive determination of words of up to 12 nucleotides in DNA sequences. It is fast enough as to be used at a genomic scale ru...
166
click to vote
SPAA
2010
ACM
15 years 8 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...