2109 search results - page 212 / 422 » Solving Necklace Constraint Problems |
154
click to vote
AAAI
1996
15 years 7 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
176
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
— Ergodic stochastic optimization (ESO) algorithms are proposed to solve resource allocation problems that involve a random state and where optimality criteria are expressed in t...
178
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
156
click to vote
ISCAS
1994
IEEE
15 years 10 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
190
Voted
TOG
2012
13 years 8 months ago
2012
We present a method for recovering a temporally coherent, deforming triangle mesh with arbitrarily changing topology from an incoherent sequence of static closed surfaces. We solv...