4843 search results - page 272 / 969 » The Shortcut Problem - Complexity and Approximation |
109
click to vote
SIAMJO
2010
15 years 2 months ago
2010
In this paper, we propose a hybrid Gauss-Newton structured BFGS method with a new update formula and a new switch criterion for the iterative matrix to solve nonlinear least square...
107
Voted
WALCOM
2010
IEEE
15 years 10 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
124
Voted
ASIAMS
2008
IEEE
15 years 10 months ago
2008
IEEE
The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possibl...
149
Voted
ICCS
2007
Springer
15 years 10 months ago
2007
Springer
Assimilation of spatially- and temporally-distributed state observations into simulations of dynamical systems stemming from discretized PDEs leads to inverse problems with high-di...
131
click to vote
ECCV
2006
Springer
15 years 7 months ago
2006
Springer
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...