Sciweavers

985 search results - page 10 / 197
» Piercing Convex Sets
Sort
View
COMPGEOM
2004
ACM
15 years 2 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
IVC
2010
68views more  IVC 2010»
14 years 4 months ago
Digital Steiner sets and Matheron semi-groups
The Euclidean hirerachies of openings satisfy Matheron semi-groups law
Jean Serra
JAT
2006
64views more  JAT 2006»
14 years 9 months ago
A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert
A new iterative method for finding the projection onto the intersection of two closed convex sets in a Hilbert space is presented. It is a Haugazeau-like modification of a recentl...
Heinz H. Bauschke, Patrick L. Combettes, D. Russel...
ICPR
2004
IEEE
15 years 10 months ago
Missing Microarray Data Estimation Based on Projection onto Convex Sets Method
DNA microarrays have gained widespread uses in biological studies. Missing values in a microarray experiment must be estimated before further analysis. In this paper, we propose a...
Alan Wee-Chung Liew, Hong Yan, Xiangchao Gan
76
Voted
CORR
2004
Springer
103views Education» more  CORR 2004»
14 years 9 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...