Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
The specification of schema mappings has proved to be time and resource consuming, and has been recognized as a critical bottleneck to the large scale deployment of data integrati...
Khalid Belhajjame, Norman W. Paton, Suzanne M. Emb...
Background: Transposable elements (TE) are mobile genetic entities present in nearly all genomes. Previous work has shown that TEs tend to have a different nucleotide composition ...
We consider the problem of mapping data in peerto-peer systems. Such systems rely on simple value searches to locate data of interest. However, different peers may use different v...
This paper proposes an ontology mapping based framerowk that allows searching for web resources using multiple ontologies. The proposed solution uses a mapping ontology that is a ...