2745 search results - page 241 / 549 » A fast algorithm for computing large Fibonacci numbers |
133
Voted
CVPR
1998
IEEE
16 years 6 months ago
1998
IEEE
The problem considered in this paper is that of estimating the projective transformation between two images in situations where the image motion is large and featurematching is no...
121
Voted
PR
2008
15 years 4 months ago
2008
Clustering in gene expression data sets is a challenging problem. Different algorithms for clustering of genes have been proposed. However due to the large number of genes only a ...
114
click to vote
RECOMB
2010
Springer
15 years 11 months ago
2010
Springer
We introduce the first polynomial-time phylogenetic reconstruction algorithm under a model of sequence evolution allowing insertions and deletions—or indels. Given appropriate ...
130
click to vote
BIRTHDAY
2004
Springer
15 years 10 months ago
2004
Springer
We give faster algorithms for two methods of reducing the number of states in nondeterministic finite automata. The first uses equivalences and the second uses preorders. We deve...
142
click to vote
IEEEPACT
1998
IEEE
15 years 8 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...