Although propositional satisfiability (SAT) is NP-complete, state-of-the-art SAT solvers are able to solve large, practical instances. The concept of backdoors has been introduced...
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
This article introduces a new theory of intention representation which is based1 on a structure called a Dynamic Intention Structure (DIS). The theory of DISs was motivated2 by the...
As an alternative to vector representations, a recent trend in image classification suggests to integrate additional structural information in the description of images in order to...
We introduce a novel nonrigid 2D image registration method that establishes dense and accurate correspondences across images without the need of any manual intervention. Our key in...