Sciweavers

16 search results - page 1 / 4
» Improved spectral relaxation methods for binary quadratic op...
Sort
View
CVIU
2008
130views more  CVIU 2008»
13 years 5 months ago
Improved spectral relaxation methods for binary quadratic optimization problems
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
CVPR
2007
IEEE
14 years 7 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
NIPS
2000
13 years 6 months ago
Improved Output Coding for Classification Using Continuous Relaxation
Output coding is a general method for solving multiclass problems by reducing them to multiple binary classification problems. Previous research on output coding has employed, alm...
Koby Crammer, Yoram Singer
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
IPCO
1993
98views Optimization» more  IPCO 1993»
13 years 6 months ago
A spectral approach to bandwidth and separator problems in graphs
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
Christoph Helmberg, Bojan Mohar, Svatopluk Poljak,...