380 search results - page 28 / 76 » Instance Matching with COMA |
ESWS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Ontology matching has become an important field of research over the last years. Although many different approaches have been proposed, only few of them are committed t...
ICDE
2008
IEEE
14 years 2 months ago
2008
IEEE
— We propose a new approach to the problem of schema matching in relational databases that merges the hybrid and composite approach of combining multiple individual matching tech...
DSD
2005
IEEE
14 years 1 months ago
2005
IEEE
An implementation of an algorithm for string matching, commonly used in DNA string analysis, using configurable technology is proposed. The design of the circuit allows for pipeli...
TPHOL
2003
IEEE
14 years 28 days ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
FGCS
2007
13 years 7 months ago
2007
We propose a semi-automated method for redeploying bioinformatic databases indexed in a Web portal as a decentralized, semantically integrated and service-oriented Data Grid. We g...