We address the problem of constructing randomized online algorithms for the Metrical Task Systems (MTS) problem on a metric against an oblivious adversary. Restricting our attenti...
Jacob Abernethy, Peter L. Bartlett, Niv Buchbinder...
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
This paper considers the diagnosis of large discrete-event systems consisting of many components. The problem is to determine, online, all failures and states that explain a given...
The recently introduced online confidence-weighted (CW) learning algorithm for binary classification performs well on many binary NLP tasks. However, for multi-class problems CW l...
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...
Irene Ntoutsi, Arthur Zimek, Themis Palpanas, Peer...