We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
Background: High throughput microarray analyses result in many differentially expressed genes that are potentially responsible for the biological process of interest. In order to ...
Blaise T. F. Alako, Antoine Veldhoven, Sjozef van ...