Sciweavers

14548 search results - page 189 / 2910
» The Optimal Path-Matching Problem
Sort
View
ICASSP
2011
IEEE
13 years 2 months ago
Extended Viterbi algorithm for optimized word HMMS
This paper deals with the problem of finding the optimal sequence of sub-word unit HMMs for a number of given utterances of a word. For this problem we present a new solution bas...
Michael Gerber, Tobias Kaufmann, Beat Pfister
MP
2011
13 years 1 months ago
Strong KKT conditions and weak sharp solutions in convex-composite optimization
Using variational analysis techniques, we study convex-composite optimization problems. In connection with such a problem, we introduce several new notions as variances of the clas...
Xi Yin Zheng, Kung Fu Ng
JMLR
2012
12 years 1 months ago
Generic Methods for Optimization-Based Modeling
“Energy” models for continuous domains can be applied to many problems, but often suffer from high computational expense in training, due to the need to repeatedly minimize t...
Justin Domke
DLOG
2010
13 years 8 months ago
Optimal Rewritings in Definitorially Complete Description Logics
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
Inanç Seylan, Enrico Franconi, Jos de Bruij...
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
13 years 5 months ago
Robust controller design by convex optimization based on finite frequency samples of spectral models
Abstract-- Some frequency-domain controller design problems are solved using a finite number of frequency samples. Consequently, the performance and stability conditions are not gu...
Gorka Galdos, Alireza Karimi, Roland Longchamp