Sciweavers

985 search results - page 77 / 197
» Piercing Convex Sets
Sort
View
COLT
2010
Springer
13 years 8 months ago
Composite Objective Mirror Descent
We present a new method for regularized convex optimization and analyze it under both online and stochastic optimization settings. In addition to unifying previously known firstor...
John Duchi, Shai Shalev-Shwartz, Yoram Singer, Amb...
MOR
2010
79views more  MOR 2010»
13 years 4 months ago
A Geometric Proof of Calibration
We provide yet another proof of the existence of calibrated forecasters; it has two merits. First, it is valid for an arbitrary finite number of outcomes. Second, it is short and ...
Shie Mannor, Gilles Stoltz
DRR
2009
13 years 8 months ago
Using synthetic data safely in classification
When is it safe to use synthetic data in supervised classification? Trainable classifier technologies require large representative training sets consisting of samples labeled with...
Jean Nonnemaker, Henry Baird
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
13 years 11 months ago
Separation and Approximation of Polyhedral Objects
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
Joseph S. B. Mitchell, Subhash Suri
COMPGEOM
1991
ACM
14 years 1 months ago
Crossing Families
Given a set of points in the plane, a crossing family is a collection of line segments, each joining two of the points, such that any two line segments intersect internally. Two s...
Boris Aronov, Paul Erdös, Wayne Goddard, Dani...