488 search results - page 33 / 98 » Automorphic Decompositions of Graphs |
FLAIRS
2006
13 years 9 months ago
2006
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
ICSE
2008
IEEE-ACM
14 years 7 months ago
2008
IEEE-ACM
Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given s...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
ICCD
1996
IEEE
13 years 11 months ago
1996
IEEE
The Multi-Level Decomposition Diagrams (MLDDs) of this paper are a canonical representation of Boolean functions expliciting disjoint-support decompositions. MLDDs allow the reduc...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—Thorup-Zwick (TZ) compact routing guarantees sublinear state growth with the size of the network by routing via landmarks and incurring some path stretch. It uses a pseudo-rando...