这是一个二择其一的问题。
Now that we have unwound the threads of management style and delivery methodology we can address Myth of methodology as a binary decision.
既然我们已经解开了管理风格和交付方式的谜团，接下来我们再讲一下关于二元决策方法的神话。
Gaussian similarity is used for measuring the distance of different covariance. A binary decision tree is constructed with this measure.
该算法是用高斯相似度度量协方差矩阵间的距离，并由此测度建立了反映协方差矩阵结构关系的二叉决策树。
At last, a binary decision tree could be built. Algorithm analysis and simulation results show that RMBRDM can support rules with ranges and the performance of RMBRDM is better than that of PTS.
最后建立一棵二叉决策树。理论分析和仿真实验均表明，RMBRDM算法不仅支持以范围形式表示的规则，且时空性能优于PTS算法。
Now, the decision tree, if I branch left, it's a binary tree.
现在，这个决策树，如果我走左边的分支，这是一棵二叉树。
A new dynamic heuristic binary decision diagram (BDD) minimization algorithm is proposed.
提出了一种新的动态启发式二叉判定图(BDD)最小化算法。
A hierarchical decomposed support vector machines binary decision tree is used for classification.
采用一种层次分解的支持向量机二叉决策树进行分类识别。
Ordered binary decision diagrams(OBDDs)are a data structure for efficient representation and manipulation of Boolean functions. The size of OBDDs is very sensitive to variable ordering.
有序二叉决策图（OBDD）是一种有效表示布尔函数的数据结构，其大小依赖于所采用的变量序。
If the target malware is new to the scanner, the accuracy of the analyzer output is not dependent on a simple binary decision.
如果一个目标对于扫描器是新的威胁，正确的分析结论并不是依靠一个简单的二元判定。
This paper presents a testability optimization method based on free binary decision diagram transformation.
提出了一种基于自由二元判决图转换的可测性优化方法。
Using Binary Decision Diagrams, this paper proposes a test generation method for functional level digital circuits.
本文利用二叉判定图提出了对功能级数字电路的一种测试产生方法。
Only modifying the structure of binary discernable matrix simply, it is easy to compute the core of a changeable decision table. The method is demonstrated t...
只需简单更改二进制可辨矩阵的结构，就可以计算动态变化的决策表的核属性，并通过实例验证了该方法的正确性和有效性。
The method is based on a binary image. First, the authors extract the features of every numeral in the image, then classify the numerals by a decision tree.
这种算法基于二值图像，先从二值图像中找出各数字的特征，然后再用决策树对这些数字进行分类。
By the B-cut sets and the probabilities of the nodes of Binary Decision Diagrams (BDD), a new quantitative analysis algorithm of coherent fault tree based on BDD is presented in this paper.
利用二元决策图(BDD)中的B—割集和节点概率，提出了基于BDD的关联故障树定量分析新算法。
By the B-cut sets and the probabilities of the nodes of Binary Decision Diagrams (BDD), a new quantitative analysis algorithm of coherent fault tree based on BDD is presented in this paper.
利用二元决策图(BDD)中的B—割集和节点概率，提出了基于BDD的关联故障树定量分析新算法。
应用推荐