Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
: Internet based distributed collaborative commerce must resolve two problems first. One is what organisation shape is and the other is how to establish an efficient and active org...
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
We propose a binary Markov Random Field (MRF) model
that assigns high probability to regions in the image domain
consisting of an unknown number of circles of a given radius.
We...
We introduce an assertion language for run-time checking of linked list data structure shapes. The assertion language is expressive enough to define characteristic predicates for ...