2695 search results - page 190 / 539 » Learning Graph Matching |
129
click to vote
TOG
2010
14 years 10 months ago
2010
We present a multiple-feature approach for determining matches between small fragments of archaeological artifacts such as Bronze-Age and Roman frescoes. In contrast with traditio...
141
click to vote
DAM
2007
15 years 3 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
185
click to vote
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
118
click to vote
ICB
2009
Springer
15 years 9 months ago
2009
Springer
The latest multi-biometric grand challenge (MBGC 2008) sets up a new experiment in which near infrared (NIR) face videos containing partial faces are used as a probe set and the vi...
116
click to vote
ICALT
2007
IEEE
15 years 9 months ago
2007
IEEE
One of the most contemporary research ideas for adaptive web-based educational systems is personalizing the educational contents, based on users’ learning styles. Moreover, it i...