2911 search results - page 240 / 583 » A Logic of Graph Constraints |
162
click to vote
MFCS
1995
Springer
15 years 10 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
148
click to vote
UAI
2004
15 years 8 months ago
2004
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...
160
click to vote
AI
2007
Springer
15 years 6 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
280
click to vote
TOPLAS
2008
15 years 6 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
191
click to vote
TCAD
1998
15 years 6 months ago
1998
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...