1056 search results - page 83 / 212 » Constraint-Based Graph Matching |
86
Voted
ICPR
2002
IEEE
16 years 1 months ago
2002
IEEE
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
106
Voted
SEMWEB
2007
Springer
15 years 6 months ago
2007
Springer
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...
97
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
130
Voted
ICCV
2011
IEEE
14 years 18 days ago
2011
IEEE
Local photometric descriptors are a crucial low level component of numerous computer vision algorithms. In practice, these descriptors are constructed to be invariant to a class o...
125
Voted
DC
2010
15 years 20 days ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...