Sciweavers

985 search results - page 39 / 197
» Piercing Convex Sets
Sort
View
NIPS
2008
15 years 3 months ago
On the Efficient Minimization of Classification Calibrated Surrogates
Bartlett et al (2006) recently proved that a ground condition for convex surrogates, classification calibration, ties up the minimization of the surrogates and classification risk...
Richard Nock, Frank Nielsen
ISIPTA
2003
IEEE
15 years 7 months ago
Expected Utility with Multiple Priors
Let be a preference relation on a convex set F. Necessary and sufficient conditions are given that guarantee the existence of a set {ul} of affine utility functions on F such th...
Erio Castagnoli, Fabio Maccheroni, Massimo Marinac...
CORR
2006
Springer
172views Education» more  CORR 2006»
15 years 2 months ago
Approximate Convex Optimization by Online Game Playing
This paper describes a general framework for converting online game playing algorithms into constrained convex optimization algorithms. This framework allows us to convert the wel...
Elad Hazan
COMPGEOM
2004
ACM
15 years 7 months ago
On distinct distances from a vertex of a convex polygon
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...
Adrian Dumitrescu
ICRA
1994
IEEE
98views Robotics» more  ICRA 1994»
15 years 6 months ago
Efficient Distance Computation Between Non-Convex Objects
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
Sean Quinlan