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...
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...
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...
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 ...
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...