We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Gr...
Most natural language database interfaces suffer from the translation knowledge portability problem, and are vulnerable to ill-formed questions because of their deep analysis. To a...
Automatic classification of documents is an important area of research with many applications in the fields of document searching, forensics and others. Methods to perform class...
There have long been threads of investigation into covert channels, and threads of investigation into anonymity, but these two closely related areas of information hiding have not...
Ira S. Moskowitz, Richard E. Newman, Daniel P. Cre...