3204 search results - page 170 / 641 » Online Learning with Constraints |
CVPR
2008
IEEE
15 years 13 days ago
2008
IEEE
Pairwise constraints specify whether or not two samples should be in one cluster. Although it has been successful to incorporate them into traditional clustering methods, such as ...
ICML
2003
IEEE
14 years 11 months ago
2003
IEEE
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We consider the classical multi-armed bandit problem with Markovian rewards. When played an arm changes its state in a Markovian fashion while it remains frozen when not played. Th...
ISCA
2011
IEEE
13 years 2 months ago
2011
IEEE
Much of the success of the Internet services model can be attributed to the popularity of a class of workloads that we call Online Data-Intensive (OLDI) services. These workloads ...
SIGECOM
2011
ACM
13 years 1 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...