We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
This paper describes an approach to providing lexical information for natural language processing in unrestricted domains. A system of approximately 1200 morphological rules is us...
We propose a propositional language for temporal reasoning that is computationally effective yet expressive enough to describe information about fluents, events and temporal const...
Abstract. We report on the notation and tool integration framework developed in the application-oriented research project Espress. The framework is based on a Z core and provides m...
In this paper we propose an extension of sequence kernels to the case where the symbols that define the sequences have multiple representations. This configuration occurs in natura...