577 search results - page 29 / 116 » New interval methods for constrained global optimization |
152
Voted
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
Probabilistic graphical models such as Bayesian Networks have been increasingly applied to many computer vision problems. Accuracy of inferences in such models depends on the quali...
138
Voted
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
126
Voted
TCOM
2011
14 years 10 months ago
2011
—Using high-rate theory approximations we introduce flexible practical quantizers based on possibly non-Gaussian models in both the constrained resolution (CR) and the constrain...
317
click to vote
ICAL
2011
14 years 3 months ago
2011
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
138
Voted
ICIP
2007
IEEE
15 years 7 months ago
2007
IEEE
Although 2D-based face recognition methods have made great progress in the past decades, there are also some unsolved problems such as PIE. Recently, more and more researchers hav...