Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
Entity annotation involves attaching a label such as `name' or `organization' to a sequence of tokens in a document. All the current rule-based and machine learningbased...
Motivated by the particular problems involved in communicating with "locked-in" paralysed patients, we aim to develop a braincomputer interface that uses auditory stimul...
N. Jeremy Hill, Thomas Navin Lal, Karin Bierig, Ni...
We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integ...
Matthew J. Beal, Zoubin Ghahramani, Carl Edward Ra...
In this paper we present a new method to estimate optical flow for large displacements. It is based on prediction of global flow field parameters, performs better than multiresolu...