Sciweavers

1064 search results - page 19 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
IVC
2007
114views more  IVC 2007»
14 years 11 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
ICCAD
2005
IEEE
144views Hardware» more  ICCAD 2005»
15 years 8 months ago
An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
Paulo F. Flores, José C. Monteiro, Eduardo ...
NIPS
2000
15 years 1 months ago
Active Support Vector Machine Classification
An active set strategy is applied to the dual of a simple reformulation of the standard quadratic program of a linear support vector machine. This application generates a fast new...
Olvi L. Mangasarian, David R. Musicant
ICML
2005
IEEE
16 years 16 days ago
New approaches to support vector ordinal regression
In this paper, we propose two new support vector approaches for ordinal regression, which optimize multiple thresholds to define parallel discriminant hyperplanes for the ordinal ...
Wei Chu, S. Sathiya Keerthi
PROCEDIA
2011
14 years 2 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff