Sciweavers

1118 search results - page 52 / 224
» Convex Optimization
Sort
View
ICCV
2011
IEEE
14 years 4 months ago
Tight Convex Relaxations for Vector-Valued Labeling Problems
The multi-label problem is of fundamental importance to computer vision, yet finding global minima of the associated energies is very hard and usually impossible in practice. Rec...
Evgeny Strekalovskiy, Bastian Goldluecke, Daniel C...
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
16 years 1 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
NIPS
2007
15 years 5 months ago
Hierarchical Penalization
Hierarchical penalization is a generic framework for incorporating prior information in the fitting of statistical models, when the explicative variables are organized in a hiera...
Marie Szafranski, Yves Grandvalet, Pierre Morizet-...
AUTOMATICA
2002
81views more  AUTOMATICA 2002»
15 years 4 months ago
A convex approach to the characterization of the frequency response of ellipsoidal plants
This paper deals with the frequency domain properties of an ellipsoidal family of rational functions, i.e. a family of rational functions whose coefficients depend affinely on an ...
Graziano Chesi, Andrea Garulli, Alberto Tesi, Anto...
FAW
2010
Springer
259views Algorithms» more  FAW 2010»
15 years 5 months ago
Adaptive Algorithms for Planar Convex Hull Problems
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...
Hee-Kap Ahn, Yoshio Okamoto