For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
We address a question posed by Sibley and Wagon. They proved that rhombic Penrose tilings in the plane can be 3colored, but a key lemma of their proof fails in the natural 3D gene...
This article proposes a solution of the Lambertian shape from shading (SFS) problem in the case of a pinhole camera model (performing a perspective projection). Our approach is ba...
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...
We present a process logic for the -calculus with the linear/affine type discipline (Berger et al. 2001; Berger et al. 2003; Honda and Yoshida 2002; Honda and Yoshida 2003; Honda ...