510 search results - page 30 / 102 » Complexity measures and decision tree complexity: a survey |
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...
FQAS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Controlled languages (CLs) are ambiguity-free subsets of natural languages such as English offering a good trade-off between the formal rigor of ontology and query langua...
NIPS
2001
13 years 10 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
WIDM
2004
ACM
14 years 1 months ago
2004
ACM
In this paper, we propose a set of similarity metrics for manipulating collections of values occuring in XML documents. Following the data model presented in TAX algebra, we treat...
KDD
1994
ACM
14 years 17 days ago
1994
ACM
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...