The following pages link to David Haussler (Q676241):
Displayed 49 items.
- Rigorous learning curve bounds from statistical mechanics (Q676243) (← links)
- Item:Q676241 (redirect page) (← links)
- On regularity of context-free languages (Q759489) (← links)
- On DOS languages and DOS mappings (Q791326) (← links)
- Insertion languages (Q796994) (← links)
- On the complexity of iterated shuffle (Q800086) (← links)
- Another generalization of Higman's well quasi order result on \(\Sigma ^*\) (Q1069312) (← links)
- On total regulators generated by derivation relations (Q1084874) (← links)
- Applications of an infinite square-free co-CFL (Q1088415) (← links)
- \(\epsilon\)-nets and simplex range queries (Q1089803) (← links)
- A new distance metric on strings computable in linear time (Q1102764) (← links)
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework (Q1106669) (← links)
- Occam's razor (Q1108056) (← links)
- Equivalence of models for polynomial learnability (Q1183606) (← links)
- Decision theoretic generalizations of the PAC model for neural net and other learning applications (Q1198550) (← links)
- A graph-theoretic generalization of the Sauer-Shelah lemma (Q1265742) (← links)
- Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension (Q1314506) (← links)
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points (Q1342520) (← links)
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension (Q1345876) (← links)
- Mutual information, metric entropy and cumulative relative entropy risk (Q1383090) (← links)
- Average sizes of suffix trees and DAWGs (Q1822940) (← links)
- Learning decision trees from random examples (Q1823009) (← links)
- A general lower bound on the number of examples needed for learning (Q1823011) (← links)
- Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions (Q1892207) (← links)
- The size of \(k\)-pseudotrees (Q1894770) (← links)
- A generalization of Sauer's lemma (Q1899068) (← links)
- Quasi-Monotonic Sequences: Theory, Algorithms and Applications (Q3033808) (← links)
- (Q3217631) (← links)
- Learnability and the Vapnik-Chervonenkis dimension (Q3474905) (← links)
- New Methods for Detecting Lineage-Specific Selection (Q3596277) (← links)
- Detecting the Dependent Evolution of Biosequences (Q3596317) (← links)
- (Q3680300) (← links)
- (Q3687737) (← links)
- (Q3738577) (← links)
- Very special languages and representations of recursively enumerable languages via computation histories (Q3907111) (← links)
- Model Completeness of an Algebra of Languages (Q3934369) (← links)
- (Q3959450) (← links)
- (Q4013531) (← links)
- (Q4013556) (← links)
- (Q4247216) (← links)
- A general minimax result for relative entropy (Q4345628) (← links)
- How to use expert advice (Q4376978) (← links)
- Scale-sensitive dimensions, uniform convergence, and learnability (Q4377590) (← links)
- Generalization performance of Bayes optimal classification algorithm for learning a perceptron (Q4491922) (← links)
- Sequential prediction of individual sequences under general loss functions (Q4701166) (← links)
- (Q4714286) (← links)
- Complete inverted files for efficient text retrieval and analysis (Q5222002) (← links)
- How to use expert advice (Q5248507) (← links)
- (Q5302088) (← links)