Andreas Wotzlaw

Learn More
We consider the problem of scheduling n independent jobs on m unrelated parallel machines without preemption. Job i takes processing time p i j on machine j, and the total time used by a machine is the sum of the processing times for the jobs assigned to it. The objective is to minimize makespan. The best known approximation algorithms for this problem(More)
Given a simple undirected graph G, the maximum k-club problem is to find a maximum-cardinality subset of nodes inducing a sub-graph of diameter at most k in G. This NP-hard generalization of clique, originally introduced to model low diameter clusters in social networks, is of interest in network-based data mining and clustering applications. We give two(More)
We present the architecture and the evaluation of a new system for recognizing textual entailment (RTE). In RTE we want to identify automatically the type of a logical relation between two input texts. In particular, we are interested in proving the existence of an entailment between them. We conceive our system as a modular environment allowing for a(More)
—This paper describes an application for computing first-order semantic representations of English texts. It is based on a combination of hybrid shallow-deep components arranged within the middleware framework Heart of Gold. The shallow-deep semantic analysis employs Robust Minimal Recursion Semantics (RMRS) as a common semantic underspecification formalism(More)
We present a probabilistic analysis of random mixed Horn formulas (MHF), i.e., formulas in conjunctive normal form consisting of a positive monotone part of quadratic clauses and a part of Horn clauses, with m clauses, n variables, and up to n literals per Horn clause. For MHFs parameterized by n and m with uniform distribution of instances and for large n,(More)