1221 search results - page 36 / 245 » Balanced graph partitioning |
FLAIRS
2006
13 years 10 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...
LION
2009
Springer
14 years 3 months ago
2009
Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
CEC
2008
IEEE
14 years 3 months ago
2008
IEEE
— In this paper, a new meta-method based on the physical nuclear process is presented. This meta-method called Fusion-Fission is applied to the two different class of graph parti...
PLDI
2003
ACM
14 years 2 months ago
2003
ACM
Clustered architectures are a solution to the bottleneck of centralized register files in superscalar and VLIW processors. The main challenge associated with clustered architectu...
JGT
2006
13 years 8 months ago
2006
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...