We consider spatial databases and queries definable using first-order logic and real polynomial inequalities. We are interested in topological queries: queries whose result only ...
This paper describes a study of the patterns of translational equivalence exhibited by a variety of bitexts. The study found that the complexity of these patterns in every bitext ...
Benjamin Wellington, Sonjia Waxmonsky, I. Dan Mela...
Abstract— One of the relations used with granularity is indistinguishability, where distinguishable entities in a finer-grained granule are indistinguishable in a coarser-graine...
In this paper, we propose a novel technique on mining relationships in a sequential circuit to discover global constraints. In contrast to the traditional learning methods, our mi...
Design of embedded systems is a complex task that requires design cycles founded upon formal notation, so that the synthesis from specification to implementation can be carried ou...