Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
This paper expands the role of the new field of computational topology by surveying methods for incorporating connectedness in shape modeling. Two geometric representations in par...
Abstract. This paper presents viewpoint-dependent constraints that relate image features such as t-junctions and inflections to the pose of curved 3D objects. These constraints can...
Ill-posed linear equations are pervasive in computer vision. A popular way to solve an ill-posed problem is regularization. In this paper, we propose a new criterion for designing ...
The calculation of Hamiltonian Circuits is an NP-complete task. This paper uses slightly modified complete sets of Hamiltonian circuits for the classification of documents. The sol...