985 search results - page 76 / 197 » Piercing Convex Sets |
NIPS
2008
13 years 11 months ago
2008
We consider robust least-squares regression with feature-wise disturbance. We show that this formulation leads to tractable convex optimization problems, and we exhibit a particul...
ICML
2005
IEEE
14 years 11 months ago
2005
IEEE
This paper presents an algorithm to estimate simultaneously both mean and variance of a non parametric regression problem. The key point is that we are able to estimate variance l...
NIPS
2003
13 years 11 months ago
2003
This paper presents a method for learning a distance metric from relative comparison such as “A is closer to B than A is to C”. Taking a Support Vector Machine (SVM) approach,...
SODA
2003
ACM
13 years 11 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
BC
1999
13 years 9 months ago
1999
Abstract-- This paper surveys two advanced associative memory models[8][5]. The first model was derived from the projection on a closed convex set spanned by patterns. The second m...