The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
Previous studies of data-driven dependency parsing have shown that the distribution of parsing errors are correlated with theoretical properties of the models used for learning an...
In this paper we present a number of improvements that were recently made to the template based speech recognition system developed at ESAT. Combining these improvements resulted ...
Kris Demuynck, Dino Seppi, Hugo Van hamme, Dirk Va...
The dependability of overlay services rely on the overlay network’s capabilities to effectively diagnose and recover faults (e.g., link failures, overlay node outages). However,...
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...