1056 search results - page 87 / 212 » Constraint-Based Graph Matching |
EMMCVPR
2005
Springer
14 years 2 months ago
2005
Springer
We consider the use of medial surfaces to represent symmetries of cts. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree o...
JCT
2010
13 years 7 months ago
2010
Let m1, m2, . . . , mt be a list of integers. It is shown that there exists an integer N such that for all n ≥ N, the complete graph of order n can be decomposed into edge-disjo...
DAM
2002
13 years 9 months ago
2002
We consider the stable marriage problem where participants are permitted to express indifference in their preference lists (i.e., each list can be partially ordered). We prove tha...
DATE
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
CC
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...