Sciweavers

2 search results - page 1 / 1
» Algebraic Methods in the Congested Clique
Sort
View
ECSQARU
1995
Springer
13 years 11 months ago
Parametric Structure of Probabilities in Bayesian Networks
The paper presents a method for uncertainty propagation in Bayesian networks in symbolic, as opposed to numeric, form. The algebraic structure of probabilities is characterized. Th...
Enrique Castillo, José Manuel Gutiér...
SPAA
2004
ACM
14 years 25 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter