1092 search results - page 30 / 219 » Convex Methods for Transduction |
SAS
2005
Springer
14 years 1 months ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper, we consider the problem of minimizing a non-smooth convex problem using first-order methods. The number of iterations required to guarantee a certain accuracy for ...
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
MP
2008
13 years 7 months ago
2008
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...