Sciweavers

77 search results - page 11 / 16
» Extended Viterbi algorithm for optimized word HMMS
Sort
View
SIAMJO
2010
130views more  SIAMJO 2010»
13 years 2 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
AUTOMATICA
2008
167views more  AUTOMATICA 2008»
13 years 7 months ago
Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
Erin M. Aylward, Pablo A. Parrilo, Jean-Jacques E....
MFCS
2004
Springer
14 years 21 days ago
The Bidimensional Theory of Bounded-Genus Graphs
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...
SIAMCO
2000
123views more  SIAMCO 2000»
13 years 7 months ago
Adaptive LQG Control of Input-Output Systems---A Cost-biased Approach
In this paper, we consider linear systems in input-output form and introduce a new adaptive linear quadratic Gaussian (LQG) control scheme which is shown to be self-optimizing. The...
Maria Prandini, Marco C. Campi
PE
2010
Springer
144views Optimization» more  PE 2010»
13 years 2 months ago
A unified framework for the bottleneck analysis of multiclass queueing networks
We introduce a new framework supporting the bottleneck analysis of closed, multiclass BCMP queueing networks in the limiting regime where the number of jobs proportionally grows t...
Jonatha Anselmi, Paolo Cremonesi