2181 search results - page 75 / 437 » The restriction scaffold problem |
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
UC
2009
Springer
14 years 3 months ago
2009
Springer
Membrane systems with dividing and dissolving membranes are known to solve PSPACE problems in polynomial time. However, we give a P upperbound on an important restriction of such s...
AUTOMATICA
2002
13 years 8 months ago
2002
This paper considers the problem of designing a controller for an unknown plant based on input/output measurements. The new design method we propose is direct (no model identificat...
WAOA
2004
Springer
14 years 2 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
CSR
2007
Springer
14 years 2 months ago
2007
Springer
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...