— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...
Huma Lodhi, Stephen Muggleton, Michael J. E. Stern...
In this paper, we introduce a generic framework for semi-supervised kernel learning. Given pairwise (dis-)similarity constraints, we learn a kernel matrix over the data that respe...
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...