— One of the most difficult aspects of dealing with illumination effects in computer vision is accounting for specularity in the images of real objects. The specular regions in ...
In this paper we introduce algorithms to voxelize polygonal meshes in common sampling lattices. In the case of Cartesian lattices, we complete the separability and minimality proo...
act Approach to Process Equivalence Bartek Klin Pawel Soboci´nski BRICS University of Aarhus, Denmark Abstract. A framework of Plotkin and Turi’s, originally aimed at providing ...
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
Despite practical successes with the Futamura projections, it has been an open question whether target programs produced by specializing interpreters can always be as efficient as ...