Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...
In this paper we combine the results of our refactoring reconstruction technique with bug, mail and release information to perform process and bug analyses of the ARGOUML CVS arch...
We present a way to incorporate backtracking and dynamic patching into existing debuggers, without requiring any change to their source code, the compiler or the run-time environm...
Bjorn De Sutter, Bruno De Bus, Michiel Ronsse, Koe...
This paper presents the results of experiments in which we tested different kinds of features for retrieval of Chinese opinionated texts. We assume that the task of retrieval of o...
A simple and general method is described that can combine different knowledge sources to reorder N-best lists of hypotheses produced by a speech recognizer. The method is automati...
Manny Raynez, David Carter, Vassilios Digalakis, P...