Sciweavers

449 search results - page 38 / 90
» Measuring the Similarity of Geometric Graphs
Sort
View
ICIAP
2003
ACM
14 years 24 days ago
Color matching by using tuple matching
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
Dirk Balthasar
CAGD
2006
73views more  CAGD 2006»
13 years 7 months ago
Rational surfaces with linear normals and their convolutions with rational surfaces
It is shown that polynomial (or rational) parametric surfaces with a linear field of normal vectors are dual to graphs bivariate polynomials (or rational functions). We discuss th...
Maria Lucia Sampoli, Martin Peternell, Bert Jü...
SEMWEB
2007
Springer
14 years 1 months ago
SODA: an OWL-DL based Ontology Matching System
This paper describes SODA a novel ontology alignment method for the OWL-DL format. SODA uses a new approach that consists in computing local and semantic similarities among ontolog...
Sami Zghal, Sadok Ben Yahia, Engelbert Mephu Nguif...
ACL
2006
13 years 9 months ago
Unsupervised Part-of-Speech Tagging Employing Efficient Graph Clustering
An unsupervised part-of-speech (POS) tagging system that relies on graph clustering methods is described. Unlike in current state-of-the-art approaches, the kind and number of dif...
Chris Biemann
ICPR
2008
IEEE
14 years 8 months ago
Similarity-based matching for face authentication
We propose in this paper a face authentication method based on a similarity measure. The SIFT descriptor is used to define some interest keypoints characterized by an invariant pa...
Christophe Rosenberger, Luc Brun