This paper introduces a novel and very accurate segmentation algorithm. It is very efficient and consumes less than 10% of CPU on a simple desktop PC to segment a stream in real-t...
We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each ...
Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskev...
We present a system for efficient indexed querying of XML documents, enhanced with sibling operations. R-tree index proposed in [5] has a very high cost for the following-sibling...
Abstract. We think of Match as an operator which takes two graph-like structures and produces a mapping between those nodes of the two graphs that correspond semantically to each o...
Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskev...
We describe a simple but expressive calculus of sequential processes, represented as coroutines. We show that this calculus can be used to express a variety of programming languag...