985 search results - page 147 / 197 » Piercing Convex Sets |
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Recently, instead of selecting a single kernel, multiple kernel learning (MKL) has been proposed which uses a convex combination of kernels, where the weight of each kernel is opt...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
In this paper, we address the problem of learning when some cases are fully labeled while other cases are only partially labeled, in the form of partial labels. Partial labels are...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Online boosting is one of the most successful online learning algorithms in computer vision. While many challenging online learning problems are inherently multi-class, online boo...
SUM
2009
Springer
14 years 2 months ago
2009
Springer
Bayesian networks are probabilistic graphical models widely employed in AI for the implementation of knowledge-based systems. Standard inference algorithms can update the beliefs a...