777 search results - page 51 / 156 » A fast algorithm for the computation of an upper bound on th... |
ISMB
1993
13 years 9 months ago
1993
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
CASC
2009
Springer
14 years 2 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
CSL
2004
Springer
13 years 11 months ago
2004
Springer
It is well known that in an o-minimal hybrid system the continuous and discrete components can be separated, and therefore the problem of finite bisimulation reduces to the same pr...
CAV
2007
Springer
14 years 1 months ago
2007
Springer
ng-Lens Abstraction for Markov Decision Processes⋆ In Proc. of CAV 2007: 19th International Conference on Computer-Aided Verification, Lectures Notes in Computer Science. c Spri...