Skip to search formSkip to main contentSkip to account menu

Decision tree model

Known as: Query complexity, Decision tree complexity, Quantum query complexity 
In computational complexity and communication complexity theories the decision tree model is the model of computation or communication in which an… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
Analysis of algorithmsBinary treeCertificate (complexity)Clique problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Clustering Via Crowdsourcing
In recent years, crowdsourcing, aka human aided computation has emerged as an effective platform for solving problems that are… 
2013
2013
An Experimental Investigation of Complexity in Database Query Formulation Tasks
1. INTRODUCTION Information Technology professionals and other knowledge workers rely on their ability to extract data from… 
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… 
Highly Cited
2007
Highly Cited
2007
Software quality estimation with limited fault data: a semi-supervised learning perspective
We addresses the important problem of software quality analysis when there is limited software fault or fault-proneness data. A… 
2006
2006
Learning probabilistic decision trees for AUC
Highly Cited
2005
Highly Cited
2005
Development of multispectral image processing algorithms for identification of wholesome, septicemic, and inflammatory process chickens ☆
2003
2003
Polynomial-fuzzy decision tree structures for classifying medical data
2000
2000
Combining the Principal Components Method with Di erent Learning Algorithms
Principal components PCO s analysis is an unsupervised projection method that computes linear combinations of the original at… 
1996
1996
Binary linear decision tree with genetic algorithm
A linear decision binary tree structure is proposed in constructing piecewise linear classifiers with the genetic algorithm (GA… 
1993
1993
On the query complexity of learning
We consider the problem of learning parametrized concept classes with membership and equivalence queries. If C. is the concept… 
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)