Sciweavers

1064 search results - page 24 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
OL
2010
77views more  OL 2010»
15 years 2 months ago
A note on Burer's copositive representation of mixed-binary QPs
In an important paper, Burer [2] recently showed how to reformulate general mixed-binary quadratic optimization problems (QPs) into copositive programs where a linear functional i...
Immanuel M. Bomze, Florian Jarre
ICASSP
2010
IEEE
15 years 3 months ago
Sparsity maximization under a quadratic constraint with applications in filter design
This paper considers two problems in sparse filter design, the first involving a least-squares constraint on the frequency response, and the second a constraint on signal-to-noi...
Dennis Wei, Alan V. Oppenheim
CVPR
2010
IEEE
16 years 1 days ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler
144
Voted
SIAMJO
2010
87views more  SIAMJO 2010»
15 years 2 months ago
A Second Derivative SQP Method: Global Convergence
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
Nicholas I. M. Gould, Daniel P. Robinson
128
Voted
CVPR
2010
IEEE
15 years 6 months ago
Co-clustering of Image Segments Using Convex Optimization Applied to EM Neuronal Reconstruction
This paper addresses the problem of jointly clustering two segmentations of closely correlated images. We focus in particular on the application of reconstructing neuronal structu...
Shiv Vitaladevuni, Ronen Basri