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 ...
Alexander Rakhlin, Jacob Abernethy, Peter L. Bartl...
e-Science is scientific investigation performed through distributed global collaborations between scientists and their resources, and the computing infrastructure that enables this...
Abstract. The aim of this work is to forecast future events in financial data sets, in particular, we focus our attention on situations where positive instances are rare, which fal...
Personalization of web search results as a technique for improving user satisfaction has received notable attention in the research community over the past decade. Much of this wo...
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...