Sciweavers

1387 search results - page 41 / 278
» Convexity in Discrete Space
Sort
View
COMPGEOM
2004
ACM
15 years 7 months ago
On empty convex polygons in a planar point set
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
Rom Pinchasi, Rados Radoicic, Micha Sharir
NIPS
2008
15 years 3 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr
ECCV
2006
Springer
15 years 5 months ago
Robust Homography Estimation from Planar Contours Based on Convexity
Abstract. We propose a homography estimation method from the contours of planar regions. Standard projective invariants such as cross ratios or canonical frames based on hot points...
Alberto Ruiz, Pedro E. López-de-Teruel, Lor...
ICASSP
2011
IEEE
14 years 5 months ago
A convex approximation approach to weighted sum rate maximization of multiuser MISO interference channel under outage constraint
This paper considers weighted sum rate maximization of multiuser multiple-input single-output interference channel (MISO-IFC) under outage constraints. The outage-constrained weig...
Wei-Chiang Li, Tsung-Hui Chang, Che Lin, Chong-Yun...
CVPR
2012
IEEE
13 years 4 months ago
What is optimized in tight convex relaxations for multi-label problems?
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
Christopher Zach, Christian Hane, Marc Pollefeys