3088 search results - page 73 / 618 » Online Passive-Aggressive Algorithms |
141
Voted
NIPS
2003
15 years 6 months ago
2003
We consider situations where training data is abundant and computing resources are comparatively scarce. We argue that suitably designed online learning algorithms asymptotically ...
175
click to vote
STOC
1997
ACM
15 years 9 months ago
1997
ACM
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
136
click to vote
DAGSTUHL
1996
15 years 6 months ago
1996
Abstract. Most applications of competitive analysis have involved online problems where a candidate on-line algorithm must compete on some input sequence against an optimal o -line...
159
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In this report, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decisio...
136
Voted
ICONIP
2009
15 years 2 months ago
2009
In contrast to traditional machine learning algorithms, where all data are available in batch mode, the new paradigm of streaming data poses additional difficulties, since data sam...