3 search results - page 1 / 1 » Pushing the Power of Stochastic Greedy Ordering Schemes for ... |
AAAI
2011
12 years 4 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
AAAI
2011
12 years 4 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
BMCBI
2005
13 years 4 months ago
2005
Background: Coalescent simulations are playing a large role in interpreting large scale intraspecific sequence or polymorphism surveys and for planning and evaluating association ...