Sciweavers

2827 search results - page 38 / 566
» Robustness of PSPACE-complete sets
Sort
View
SIAMJO
2008
104views more  SIAMJO 2008»
13 years 7 months ago
A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance
This paper concerns a fractional function of the form xT a/ xT Bx, where B is positive definite. We consider the game of choosing x from a convex set, to maximize the function, an...
Seung-Jean Kim, Stephen P. Boyd
CAD
1998
Springer
13 years 7 months ago
Solving geometric constraint systems. II. A symbolic approach and decision of Rc-constructibility
Abstract. This paper reports a geometric constraint solving approach based on symbolic computation. With this approach, we can compute robust numerical solutions for a set of equat...
Xiao-Shan Gao, Shang-Ching Chou
ICCSA
2003
Springer
14 years 26 days ago
Robust Speaker Recognition Against Utterance Variations
A speaker model in speaker recognition system is to be trained from a large data set gathered in multiple sessions. Large data set requires large amount of memory and computation, ...
JongJoo Lee, JaeYeol Rheem, Ki Yong Lee
AUTOMATICA
2007
129views more  AUTOMATICA 2007»
13 years 7 months ago
Robust control of polytopic systems by convex optimization
— Robust control synthesis of linear time-invariant SISO polytopic systems is investigated using the polynomial approach. A convex set of all stabilizing controllers for a polyto...
Alireza Karimi, Hamid Khatibi, Roland Longchamp
CORR
2011
Springer
176views Education» more  CORR 2011»
13 years 2 months ago
Inner approximations for polynomial matrix inequalities and robust stability regions
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by para...
Didier Henrion, Jean B. Lasserre