1056 search results - page 128 / 212 » Constraint-Based Graph Matching |
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we present a novel entity coreference algorithm for Semantic Web instances. The key issues include how to locate context information and how to utilize the context ...
CVPR
2005
IEEE
14 years 11 months ago
2005
IEEE
We present a surprisingly simple system that allows for robust normal reconstruction by dense photometric stereo, in the presence of severe shadows, highlight, transparencies, com...
ICCV
2007
IEEE
14 years 11 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
KDD
2005
ACM
14 years 9 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
COCO
2009
Springer
14 years 3 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...