Sciweavers

478 search results - page 8 / 96
» Convexity minimizes pseudo-triangulations
Sort
View
COMGEO
2004
ACM
13 years 6 months ago
Convexity minimizes pseudo-triangulations
The number of minimum pseudo-triangulations is minimized for point sets in convex position. 2004 Elsevier B.V. All rights reserved.
Oswin Aichholzer, Franz Aurenhammer, Hannes Krasse...
CORR
2007
Springer
85views Education» more  CORR 2007»
13 years 7 months ago
Minimization of entropy functionals
Entropy (i.e. convex integral) functionals and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on ...
Christian Léonard
DAGM
2010
Springer
13 years 5 months ago
A Convex Approach for Variational Super-Resolution
We propose a convex variational framework to compute high resolution images from a low resolution video. The image formation process is analyzed to provide to a well designed model...
Markus Unger, Thomas Pock, Manuel Werlberger, Hors...
TIP
2010
89views more  TIP 2010»
13 years 1 months ago
Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
Nonconvex nonsmooth regularization has advantages over convex regularization for restoring images with neat edges. However, its practical interest used to be limited by the difficu...
Mila Nikolova, Michael K. Ng, Chi-Pan Tam
IPCO
2010
153views Optimization» more  IPCO 2010»
13 years 5 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi