We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...
There are several dimensions and levels of complexity in which information on protein motifs may be available. For example, onedimensional sequence motifs may be associated with s...
Darrell Conklin, Suzanne Fortier, Janice I. Glasgo...
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
We propose that, at the highest level of video understanding, the human needs for meaning and the methodologies to extract it are both universal and generic. One must develop an o...
Abstract. The MiGen project is designing and developing an intelligent, exploratory environment to support 11–14-year-old students in their learning of mathematical generalisatio...