361 search results - page 25 / 73 » Approximate counting by dynamic programming |
BIBE
2005
IEEE
14 years 1 months ago
2005
IEEE
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
ESORICS
2007
Springer
14 years 1 months ago
2007
Springer
Obligations are pervasive in modern systems, often linked to access control decisions. We present a very general model of obligations as objects with state, and discuss its interac...
JSA
2008
13 years 7 months ago
2008
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
FOGA
2011
12 years 11 months ago
2011
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...