441 search results - page 6 / 89 » Convex Graph Invariants |
CSR
2008
Springer
13 years 9 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
SIAMDM
2010
13 years 6 months ago
2010
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest conve...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....
CVPR
2004
IEEE
13 years 11 months ago
2004
IEEE
We introduce a new class of distinguished regions based on detecting the most salient convex local arrangements of contours in the image. The regions are used in a similar way to ...
ATVA
2008
Springer
13 years 9 months ago
2008
Springer
The evaluation of successor or predecessor state spaces through time progress is a central component in the model-checking algorithm of dense-time automata. The definition of the t...