500 search results - page 6 / 100 » A parallel quadratic programming method for dynamic optimiza... |
116
click to vote
ICASSP
2009
IEEE
15 years 8 months ago
2009
IEEE
The LCD deblurring problem is considered as a simple bounded quadratic programming problem and is solved using conjugate gradient with early stopping criteria to avoid excessive s...
123
click to vote
ICPR
2010
IEEE
15 years 8 months ago
2010
IEEE
This paper introduces a semi-supervised distance metric learning algorithm which uses pair-wise equivalence (similarity and dissimilarity) constraints to improve the original dist...
MICCAI
2004
Springer
16 years 2 months ago
2004
Springer
In this paper we discuss image registration techniques with a focus on volume preserving constraints. These constraints can reduce the non-uniqueness of the registration problem si...
104
click to vote
APLAS
2005
ACM
15 years 6 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
114
click to vote
SIAMJO
2008
15 years 1 months ago
2008
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...