13 search results - page 2 / 3 » Matroid Representation of Clique Complexes |
FCS
2009
13 years 3 months ago
2009
- A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set'...
WG
2009
Springer
13 years 12 months ago
2009
Springer
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
SBACPAD
2007
IEEE
13 years 11 months ago
2007
IEEE
We present node level primitives for parallel exact inference on an arbitrary Bayesian network. We explore the probability representation on each node of Bayesian networks and eac...
VIZSEC
2004
Springer
13 years 10 months ago
2004
Springer
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
TC
2010
13 years 3 months ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...