5214 search results - page 41 / 1043 » The Online Specialization Problem |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We propose an online form of the cake cutting problem. This models situations where players arrive and depart during the process of dividing a resource. We show that well known fa...
ESANN
2006
13 years 9 months ago
2006
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
WWW
2002
ACM
14 years 8 months ago
2002
ACM
This paper presents a new protocol for certified email. The protocol aims to combine security, scalability, easy implementation, and viable deployment. The protocol relies on a li...
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...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...