985 search results - page 177 / 197 » Piercing Convex Sets |
175
click to vote
CORR
2011
Springer
15 years 24 days ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
202
click to vote
MP
2011
15 years 22 days ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
179
click to vote
PAMI
2011
15 years 22 days ago
2011
—A novel framework is proposed for the design of cost-sensitive boosting algorithms. The framework is based on the identification of two necessary conditions for optimal cost-sen...
151
click to vote
JMLR
2010
15 years 17 days ago
2010
Virtually all methods of learning dynamic systems from data start from the same basic assumption: the learning algorithm will be given a sequence of data generated from the dynami...
173
click to vote
JMLR
2010
15 years 17 days ago
2010
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...