A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
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 present a novel framework to reliably learn scene entry and exit locations using coherent motion regions formed by weak tracking data. We construct “entities” from weak trac...
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Abstract-- Learning by imitation and learning from demonstration have received considerable attention in robotics. However, very little research has been in the direction of provid...