12 search results - page 2 / 3 » Analyzing a generalized Loop subdivision scheme |
SIAMMA
2010
13 years 5 months ago
2010
In recent work nonlinear subdivision schemes which operate on manifold-valued data have been successfully analyzed with the aid of so-called proximity conditions bounding the diffe...
CAGD
2004
13 years 10 months ago
2004
For subdivision surfaces, it is important to characterize local shape near flat spots and points where the surface is not twice continuously differentiable. Applying general princ...
GG
2010
Springer
13 years 8 months ago
2010
Springer
Mesh subdivision algorithms are usually specified informally using graphical schemes defining local mesh refinements. These algorithms are then implemented efficiently in an impera...
JMLR
2010
13 years 5 months ago
2010
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to expre...
JMLR
2010
13 years 9 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...