1056 search results - page 16 / 212 » Constraint-Based Graph Matching |
ESA
2004
Springer
14 years 1 months ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Graph matching is an important problem in computer
vision. It is used in 2D and 3D object matching and recognition.
Despite its importance, there is little literature on
learnin...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
In this paper, we address the problem of matching I/O descriptions of services to enable their automatic service composition. Specifically, we develop a method of semantic schema ...