20197 search results - page 698 / 4040 » Comparing Computational Power |
201
click to vote
JC
2008
15 years 7 months ago
2008
In this paper we analyze the problem of adaptivity for one-step numerical methods for solving ODEs, both IVPs and BVPs, with a view to generating grids of minimal computational co...
201
click to vote
JCB
2008
15 years 7 months ago
2008
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
127
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
211
click to vote
JAR
2006
15 years 7 months ago
2006
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
191
click to vote
IEICET
2007
15 years 7 months ago
2007
We compare the convergence performance of different numerical schemes for computing the fundamental matrix from point correspondences over two images. First, we state the problem ...