Sciweavers

478 search results - page 20 / 96
» Convexity minimizes pseudo-triangulations
Sort
View
CVPR
2009
IEEE
15 years 3 months ago
Continuous Ratio Optimization via Convex Relaxation with Applications to Multiview 3D Reconstruction
We introduce a convex relaxation framework to optimally minimize continuous surface ratios. The key idea is to minimize the continuous surface ratio by solving a sequence of con...
Kalin Kolev (University of Bonn), Daniel Cremers (...
DCG
1998
80views more  DCG 1998»
13 years 7 months ago
Fitting a Set of Points by a Circle
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
Jesus Garcia-Lopez, Pedro A. Ramos, Jack Snoeyink
SIAMJO
2010
130views more  SIAMJO 2010»
13 years 2 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
AAAI
1992
13 years 9 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek
ICASSP
2010
IEEE
13 years 8 months ago
Enhancing sparsity in linear prediction of speech by iteratively reweighted 1-norm minimization
Linear prediction of speech based on 1-norm minimization has already proved to be an interesting alternative to 2-norm minimization. In particular, choosing the 1-norm as a convex...
Daniele Giacobello, Mads Græsbøll Chr...