1149 search results - page 51 / 230 » Minimally non-Pfaffian graphs |
DM
2006
14 years 12 months ago
2006
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
UAI
2004
15 years 1 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
107
click to vote
COCOON
2006
Springer
15 years 3 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
AUSAI
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Programmers employing inference in Bayesian networks typically rely on the inclusion of the model as well as an inference engine into their application. Sophisticated inf...
101
click to vote
ICCAD
2000
IEEE
15 years 4 months ago
2000
IEEE
Synchronous Data Flow (SDF) is a well-known model of computation that is widely used in the control engineering and digital signal processing domains. Existing scheduling methods ...