Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 229,805,739 papers from all fields of science
Search
Sign In
Create Free Account
Decision tree model
Known as:
Query complexity
, Decision tree complexity
, Quantum query complexity
Expand
In computational complexity and communication complexity theories the decision tree model is the model of computation or communication in which an…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
Analysis of algorithms
Binary tree
Certificate (complexity)
Clique problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
On Testing Computability by Small Width OBDDs
Oded Goldreich
Electron. Colloquium Comput. Complex.
2010
Corpus ID: 1266857
We take another step in the study of the testability of smallwidth OBDDs, initiated by Ron and Tsur (Random'09). That is, we…
Expand
2010
2010
Towards effective genomic information retrieval: The impact of query complexity and expansion strategies
Xiangming Mu
,
Kun Lu
Journal of information science
2010
Corpus ID: 206454216
The goal of this study is to examine the influence of query complexity and different query expansion strategies on the…
Expand
Highly Cited
2007
Highly Cited
2007
Software quality estimation with limited fault data: a semi-supervised learning perspective
Naeem Seliya
,
T. Khoshgoftaar
Software quality journal
2007
Corpus ID: 30335156
We addresses the important problem of software quality analysis when there is limited software fault or fault-proneness data. A…
Expand
2006
2006
Learning probabilistic decision trees for AUC
Harry Zhang
,
Jiang Su
Pattern Recognition Letters
2006
Corpus ID: 29344204
Highly Cited
2005
Highly Cited
2005
Development of multispectral image processing algorithms for identification of wholesome, septicemic, and inflammatory process chickens ☆
Chun-Chieh Yang
,
K. Chao
,
Yud-Ren Chen
2005
Corpus ID: 40538975
2003
2003
Polynomial-fuzzy decision tree structures for classifying medical data
E. Mugambi
,
A. Hunter
,
G. Oatley
,
R. Kennedy
Knowledge-Based Systems
2003
Corpus ID: 41503187
2000
2000
Computing a maximal depth point in the plane
S. Langerman
,
W. Steiger
2000
Corpus ID: 117141145
Given a set S = {P1, . . . , Pn} of n points in R , the depth of a point Q ∈ R is the minimum number of points of S that must be…
Expand
2000
2000
Combining the Principal Components Method with Di erent Learning Algorithms
Lubo Popel
2000
Corpus ID: 7898021
Principal components PCO s analysis is an unsupervised projection method that computes linear combinations of the original at…
Expand
1996
1996
Binary linear decision tree with genetic algorithm
Bing-Bing Chai
,
X. Zhuang
,
Yunxin Zhao
,
J. Sklansky
Proceedings of 13th International Conference on…
1996
Corpus ID: 26499235
A linear decision binary tree structure is proposed in constructing piecewise linear classifiers with the genetic algorithm (GA…
Expand
1993
1993
On the query complexity of learning
Sampath Kannan
Annual Conference Computational Learning Theory
1993
Corpus ID: 17367897
We consider the problem of learning parametrized concept classes with membership and equivalence queries. If C. is the concept…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE