We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed -calculus ...
This paper discusses and illustrates work in progress on the MEMO workbench for early model-based usability evaluation of interface designs. Characteristic features of the workbenc...
Anthony Jameson, Angela Mahr, Michael Kruppa, Andr...
In order to preserve our cultural heritage and for automated document processing libraries and national archives have started digitizing historical documents. In the case of degra...
Florian Kleber, Robert Sablatnig, Melanie Gau, Hei...
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...