Sciweavers

77 search results - page 3 / 16
» On Boundedness Problems for Pushdown Vector Addition Systems
Sort
View
ESANN
2004
13 years 6 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
VMCAI
2010
Springer
14 years 2 months ago
Complexity Bounds for the Verification of Real-Time Software
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
Rohit Chadha, Axel Legay, Pavithra Prabhakar, Mahe...
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
13 years 6 months ago
Support vector machine classifiers for sequential decision problems
Classification problems in critical applications such as health care or security often require very high reliability because of the high costs of errors. In order to achieve this r...
Eladio Rodriguez Diaz, David A. Castaon
CVPR
2000
IEEE
14 years 7 months ago
Nearest Neighbor Search Using Additive Binary Tree
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...
Sung-Hyuk Cha, Sargur N. Srihari
AUTOMATICA
2005
115views more  AUTOMATICA 2005»
13 years 4 months ago
Robust constrained predictive control using comparison model
This paper proposes a quadratic programming (QP) approach to robust model predictive control (MPC) for constrained linear systems having both model uncertainties and bounded distu...
Hiroaki Fukushima, Robert R. Bitmead