2695 search results - page 22 / 539 » Learning Graph Matching |
VL
1999
IEEE
15 years 4 months ago
1999
IEEE
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host...
ICIAP
2003
ACM
15 years 5 months ago
2003
ACM
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
ESA
2004
Springer
15 years 5 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, ...
STACS
2007
Springer
15 years 5 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
16 years 12 days 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 ...