96 search results - page 5 / 20 » Factoring cardinal product graphs in polynomial time |
DAM
2008
13 years 7 months ago
2008
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...
UAI
2000
13 years 8 months ago
2000
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
ARSCOM
2004
13 years 7 months ago
2004
We show that several known theorems on graphs and digraphs are equivalent. The list of equivalent theorems include Kotzig's result on graphs with unique 1-factors, a lemma by...
ICPP
1996
IEEE
13 years 11 months ago
1996
IEEE
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...