3088 search results - page 96 / 618 » Online Passive-Aggressive Algorithms |
172
click to vote
ESCAPE
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. In the online capacitated interval coloring problem, a sequence of requests arrive online. Each of the requests is an interval Ij ⊆ {1, 2, . . . , n} with bandwidth bj....
159
click to vote
SODA
2007
ACM
15 years 6 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
116
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
147
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
A number of updates for density matrices have been developed recently that are motivated by relative entropy minimization problems. The updates involve a softmin calculation based...
139
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simp...