Sciweavers

820 search results - page 98 / 164
» Inducing Temporal Graphs
Sort
View
FGR
2004
IEEE
129views Biometrics» more  FGR 2004»
15 years 7 months ago
Multiple Frame Motion Inference Using Belief Propagation
We present an algorithm for automatic inference of human upper body motion. A graph model is proposed for inferring human motion, and motion inference is posed as a mapping proble...
Jiang Gao, Jianbo Shi
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
15 years 9 months ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...
DM
2000
150views more  DM 2000»
15 years 3 months ago
A note on generalized chromatic number and generalized girth
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
Béla Bollobás, Douglas B. West
QEST
2007
IEEE
15 years 9 months ago
Qualitative Logics and Equivalences for Probabilistic Systems
We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized Ctl (Qrctl): formulas o...
Luca de Alfaro, Krishnendu Chatterjee, Marco Faell...
MST
2006
129views more  MST 2006»
15 years 3 months ago
Reachability Problems on Regular Ground Tree Rewriting Graphs
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
Christof Löding