For languages with (semi-) free word order (such as German), labelling grammatical functions on top of phrase-structural constituent analyses is crucial for making them interpreta...
Wolfgang Seeker, Ines Rehbein, Jonas Kuhn, Josef v...
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
More and more server workloads are becoming Web-based. In these Web-based workloads, most of the memory objects are used only during one transaction. We study the effect of the me...
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...