1348 search results - page 52 / 270 » Matching planar maps |
131
Voted
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
In this paper we propose extensions to the match propagation algorithm which is a technique for computing quasidense point correspondences between two views. The extensions make t...
140
click to vote
COOPIS
2004
IEEE
15 years 7 months ago
2004
IEEE
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...
150
click to vote
TCS
2008
15 years 3 months ago
2008
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
139
Voted
ASWC
2008
Springer
15 years 5 months ago
2008
Springer
Ontology matching is a promising step towards the solution to the interoperability problem of the Semantic Web. Instance-based methods have the advantage of focusing on the most ac...
182
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
In this paper we analyze the problem of schema matching, explain why it is such a "tough" problem and suggest directions for handling it effectively. In particular, we p...