This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Managing semantic heterogeneity is a complex task. One solution involves matching like terms to each other. We view Match as an operator that takes two graph-like structures (e.g....
Pavel Shvaiko, Fausto Giunchiglia, Paulo Pinheiro ...
Finding RDF individuals that refer to the same real-world entities but have different URIs is necessary for the efficient use of data across sources. The requirements for such inst...
Andriy Nikolov, Victoria S. Uren, Enrico Motta, An...
Large-scale database integration requires a significant cost in developing a global schema and finding mappings between the global and local schemas. Developing the global schema r...
Shape matching has many applications in computer vision, such as shape classification, object recognition, object detection, and localization. In 2D cases, shape instances are 2D c...