Sciweavers

1159 search results - page 32 / 232
» Binary Decision Graphs
Sort
View
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 9 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
WER
2007
Springer
14 years 3 months ago
Towards Variability Design as Decision Boundary Placement
Complex information systems have numerous design variables that are systematically decided upon during the design process. In high-variability systems, some of these decisions are...
Catalin Bidian, Eric S. K. Yu
JCT
2007
118views more  JCT 2007»
13 years 9 months ago
Excluding a planar graph from GF(q)-representable matroids
Abstract. We prove that a binary matroid with huge branchwidth contains the cycle matroid of a large grid as a minor. This implies that an infinite antichain of binary matroids ca...
Jim Geelen, Bert Gerards, Geoff Whittle
RTCSA
2000
IEEE
14 years 1 months ago
Extracting safe and precise control flow from binaries
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
Henrik Theiling
ESANN
2007
13 years 10 months ago
Exploring the causal order of binary variables via exponential hierarchies of Markov kernels
Abstract. We propose a new algorithm for estimating the causal structure that underlies the observed dependence among n (n ≥ 4) binary variables X1, . . . , Xn. Our inference pri...
Xiaohai Sun, Dominik Janzing