In this paper, we report on the development of an annotation scheme an annotation tools for unrestricted German text. Our representation format is based on argument structure, but...
Wojciech Skut, Thorsten Brants, Brigitte Krenn, Ha...
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...
An interpolation theorem holds for many standard modal logics, but first order S5 is a prominent example of a logic for which it fails. In this paper it is shown that a first orde...
Let G be a simple graph with n( 2) vertices, and i(G) be the ith largest eigenvalue of G. In this paper we obtain the following: If 3(G) < 0, and there exists some index k, 2 ...
The mortar technique turns out to be well adapted to handle mesh adaptivity in finite elements, since it allows for working with nonnecessarily compatible discretizations on the el...