We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classification problems, their computational com...
The Bag-of-visual Words (BoW) image representation has been applied for various problems in the fields of multimedia and computer vision. The basic idea is to represent images as ...
Shiliang Zhang, Qi Tian, Gang Hua, Qingming Huang,...
Involving a school teacher in the development of the intelligent writing tutor StoryStation allowed progress to be made on the problem of story classification, an aspect of story...
Background: Predicting a protein’s structural class from its amino acid sequence is a fundamental problem in computational biology. Much recent work has focused on developing ne...
Iain Melvin, Eugene Ie, Rui Kuang, Jason Weston, W...