Sciweavers

131 search results - page 17 / 27
» Orthogonal thickness of graphs
Sort
View
JMLR
2010
99views more  JMLR 2010»
13 years 2 months ago
On Combining Graph-based Variance Reduction schemes
In this paper, we consider two variance reduction schemes that exploit the structure of the primal graph of the graphical model: Rao-Blackwellised w-cutset sampling and AND/OR sam...
Vibhav Gogate, Rina Dechter
JSAT
2010
130views more  JSAT 2010»
13 years 2 months ago
DepQBF: A Dependency-Aware QBF Solver
We present DepQBF 0.1, a new search-based solver for quantified boolean formulae (QBF). It integrates compact dependency graphs to overcome the restrictions imposed by linear quan...
Florian Lonsing, Armin Biere
SWAT
1990
Springer
75views Algorithms» more  SWAT 1990»
13 years 11 months ago
Finding the k Smallest Spanning Trees
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
David Eppstein
JGAA
2007
124views more  JGAA 2007»
13 years 7 months ago
Simultaneous Border Segmentation of Doughnut-Shaped Objects in Medical Images
Image segmentation with specific constraints has found applications in several areas such as biomedical image analysis and data mining. In this paper, we study the problem of sim...
Xiaodong Wu, Michael B. Merickel
AML
2005
84views more  AML 2005»
13 years 7 months ago
Modularity of proof-nets
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...
Roberto Maieli, Quintijn Puite