16091 search results - page 395 / 3219 » Solving |
170
click to vote
WG
2009
Springer
16 years 1 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
161
click to vote
DAGM
2009
Springer
16 years 1 months ago
2009
Springer
We present a variational approach to jointly estimate a displacement map and a superresolution texture for a 3D model from multiple calibrated views. The superresolution image form...
159
click to vote
EMMCVPR
2009
Springer
16 years 1 months ago
2009
Springer
We describe a scheme for solving Energy Minimization problems, which is based on the A∗ algorithm accomplished with appropriately chosen LP-relaxations as heuristic functions. Th...
170
click to vote
SCALESPACE
2009
Springer
16 years 1 months ago
2009
Springer
Multi-class labeling is one of the core problems in image analysis. We show how this combinatorial problem can be approximately solved using tools from convex optimization. We sugg...
180
click to vote
SCALESPACE
2009
Springer
16 years 1 months ago
2009
Springer
We propose a regularization method for solving ill-posed problems, under the assumption that the solutions are piecewise constant functions with unknown level sets and unknown leve...