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...
We provide a new comparison between hexagonal and orthogonal lattices, based on approximation theory. For each of the lattices, we select the "natural" spline basis func...
We present a method for automatically acquiring of a corpus of disputed claims from the web. We consider a factual claim to be disputed if a page on the web suggests both that the...
Rob Ennals, Dan Byler, John Mark Agosta, Barbara R...
Performance of n-gram language models depends to a large extent on the amount of training text material available for building the models and the degree to which this text matches...
- With the use of an immersive display system such as the CAVE, the user is able to perceive a 3D environment realistically. However, the interaction on such systems faces some dif...
Miranda Miranda Miguel, Takefumi Ogawa, Kiyoshi Ki...