7 search results - page 1 / 2 » Algorithms for stochastic approximations of curvature flows |
ICIP
2003
IEEE
15 years 17 days ago
2003
IEEE
Curvature flows have been extensively considered from a deterministic point of view. They have been shown to be useful for a number of applications including crystal growth, flame...
ICANN
2001
Springer
14 years 3 months ago
2001
Springer
The method of conjugate gradients provides a very effective way to optimize large, deterministic systems by gradient descent. In its standard form, however, it is not amenable to ...
APPROX
2010
Springer
14 years 16 days ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
ETVC
2008
14 years 22 days ago
2008
s of the LIX Fall Colloquium 2008: Emerging Trends in Visual Computing Frank Nielsen Ecole Polytechnique, Palaiseau, France Sony CSL, Tokyo, Japan Abstract. We list the abstracts o...
SMA
2005
ACM
14 years 4 months ago
2005
ACM
Given a planar set S of arbitrary topology and a radius r, we show how to construct an r-tightening of S, which is a set whose boundary has a radius of curvature everywhere greate...