We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
We describe a large-scale application of methods for finding plagiarism and self-plagiarism in research document collections. The methods are applied to a collection of 284,834 d...
Daria Sorokina, Johannes Gehrke, Simeon Warner, Pa...
Abstract. Asbru is a complex formal language developed to represent clinical guidelines and protocols which are time- and processoriented. To facilitate and support the modeling in...
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
This paper describes a language independent method for alignment of parallel texts that makes use of homograph tokens for each pair of languages. In order to filter out tokens tha...