1056 search results - page 24 / 212 » Constraint-Based Graph Matching |
112
Voted
CIKM
2007
Springer
15 years 6 months ago
2007
Springer
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
150
Voted
ICCV
2005
IEEE
15 years 6 months ago
2005
IEEE
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...
85
Voted
CORR
2004
Springer
15 years 8 days ago
2004
Springer
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
99
Voted
JCT
2008
15 years 12 days ago
2008
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
123
click to vote
SIGMOD
2003
ACM
16 years 17 days ago
2003
ACM
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...