2695 search results - page 21 / 539 » Learning Graph Matching |
196
click to vote
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
119
click to vote
GD
2009
Springer
15 years 6 months ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
123
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
101
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
115
click to vote
PVLDB
2010
15 years 7 days ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...