Sciweavers

1521 search results - page 44 / 305
» Kernelized map matching
Sort
View
119
Voted
CVPR
2007
IEEE
16 years 4 months ago
Quasi-Dense Wide Baseline Matching Using Match Propagation
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...
Juho Kannala, Sami S. Brandt
96
Voted
ESANN
2007
15 years 4 months ago
Clustering a medieval social network by SOM using a kernel based distance measure
Abstract. In order to explore the social organization of a medieval peasant community before the Hundred Years’ War, we propose the use of an adaptation of the well-known Kohonen...
Nathalie Villa, Romain Boulet
127
Voted
COOPIS
2004
IEEE
15 years 6 months ago
Composing Mappings Between Schemas Using a Reference Ontology
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...
Eduard C. Dragut, Ramon Lawrence
124
Voted
ASWC
2008
Springer
15 years 4 months ago
Deriving Concept Mappings through Instance Mappings
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...
Balthasar A. C. Schopman, Shenghui Wang, Stefan Sc...
SIGMOD
2006
ACM
105views Database» more  SIGMOD 2006»
16 years 2 months ago
Why is schema matching tough and what can we do about it?
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...
Avigdor Gal