Sciweavers

5624 search results - page 174 / 1125
» On Conditional Covering Problem
Sort
View
CLASSIFICATION
2004
59views more  CLASSIFICATION 2004»
15 years 6 months ago
Oscillation Heuristics for the Two-group Classification Problem
: We propose a new nonparametric family of oscillation heuristics for improving linear classifiers in the two-group discriminant problem. The heuristics are motivated by the intuit...
Ognian Asparouhov, Paul A. Rubin
CEC
2007
IEEE
16 years 26 days ago
Evolving neuromodulatory topologies for reinforcement learning-like problems
— Environments with varying reward contingencies constitute a challenge to many living creatures. In such conditions, animals capable of adaptation and learning derive an advanta...
Andrea Soltoggio, Peter Dürr, Claudio Mattius...
JMLR
2010
143views more  JMLR 2010»
15 years 5 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
IVC
2011
190views more  IVC 2011»
15 years 1 months ago
A graphical model based solution to the facial feature point tracking problem
In this paper a facial feature point tracker that is motivated by applications such as human-computer interfaces and facial expression analysis systems is proposed. The proposed t...
Serhan Cosar, Müjdat Çetin
ICTAI
2003
IEEE
15 years 11 months ago
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
Benjamin W. Wah, Yixin Chen