1056 search results - page 107 / 212 » Constraint-Based Graph Matching |
JCT
1998
13 years 9 months ago
1998
We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...
ICCV
2011
IEEE
12 years 9 months ago
2011
IEEE
Videos usually consist of activities involving interactions between multiple actors, sometimes referred to as complex activities. Recognition of such activities requires modeling ...
WG
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
SKG
2006
IEEE
14 years 3 months ago
2006
IEEE
Service discovery is a key concept in a distributed Grid environment. The first step towards Grid implement is the discovery of services. In this paper, we build a new Grid servic...
ER
2007
Springer
14 years 3 months ago
2007
Springer
Provability-based semantic interoperability (PBSI) is a kind of interoperability that transcends mere syntactic translation to allow for robust, meaningful information exchange acr...