Sciweavers

28 search results - page 1 / 6
» Compact linearization for binary quadratic problems
Sort
View
4OR
2007
103views more  4OR 2007»
13 years 5 months ago
Compact linearization for binary quadratic problems
Abstract We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer...
Leo Liberti
PR
2008
202views more  PR 2008»
13 years 3 months ago
Building compact MQDF classifier for large character set recognition by subspace distribution sharing
Quadratic classifier with modified quadratic discriminant function (MQDF) has been successfully applied to recognition of handwritten characters to achieve very good performance. ...
Teng Long, Lianwen Jin
AAAI
2006
13 years 6 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
MP
2010
163views more  MP 2010»
12 years 11 months ago
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
Christoph Buchheim, Frauke Liers, Marcus Oswald
IJCAI
2003
13 years 6 months ago
Multi-prototype Support Vector Machine
We extend multiclass SVM to multiple prototypes per class. For this framework, we give a compact constrained quadratic problem and we suggest an efficient algorithm for its optimi...
Fabio Aiolli, Alessandro Sperduti