Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
We study on-line play of repeated matrix games in which the observations of past actions of the other player and the obtained reward are partial and stochastic. We define the Part...
Some online algorithms for linear classification model the uncertainty in their weights over the course of learning. Modeling the full covariance structure of the weights can prov...
Justin Ma, Alex Kulesza, Mark Dredze, Koby Crammer...
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
Online learning algorithms such as Winnow have received much attention in Machine Learning. Their performance degrades only logarithmically with the input dimension, making them us...