Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"DNF expression"”.

  1. Intractability results for problems in computational learning and approximation

    … d[superscript{1-ε}] for computing an equivalent DNF expression with minimum terms for a boolean function on d variables, given its truth table. In the study of weak learnability, we prove an optimal 1/2 + ε inapproximability for the accuracy of learning an intersection of two halfspaces with an …

    gatech Repository record for Intractability results for problems in computational learning and approximation (opens in a new tab)

  2. Efficiently Learning Monotone Decision Trees with ID3

    … as read-2 width-2 disjunctive normal form expressions. I modeled these functions as graphs and examined each type of connected component contained in these models, i.e. path graphs and cycle graphs. I determined the influence of the variables in the pieces of these graph models in order to …

    duquesne Repository record for Efficiently Learning Monotone Decision Trees with ID3 (opens in a new tab)