| Publication | Date of Publication | Type |
|---|
Complete inverted files for efficient text retrieval and analysis
Journal of the ACM | 2020-04-05 | Paper |
How to use expert advice
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
scientific article; zbMATH DE number 5485577 (Why is no real title available?)
| 2009-01-05 | Paper |
New Methods for Detecting Lineage-Specific Selection
Lecture Notes in Computer Science | 2007-08-30 | Paper |
Detecting the Dependent Evolution of Biosequences
Lecture Notes in Computer Science | 2007-08-30 | Paper |
Generalization performance of Bayes optimal classification algorithm for learning a perceptron
Physical Review Letters | 2000-07-16 | Paper |
scientific article; zbMATH DE number 1301979 (Why is no real title available?)
| 2000-04-06 | Paper |
Sequential prediction of individual sequences under general loss functions
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Mutual information, metric entropy and cumulative relative entropy risk
The Annals of Statistics | 1999-09-21 | Paper |
A graph-theoretic generalization of the Sauer-Shelah lemma
Discrete Applied Mathematics | 1998-09-27 | Paper |
How to use expert advice
Journal of the ACM | 1998-02-17 | Paper |
Scale-sensitive dimensions, uniform convergence, and learnability
Journal of the ACM | 1998-02-17 | Paper |
A general minimax result for relative entropy
IEEE Transactions on Information Theory | 1998-01-13 | Paper |
Rigorous learning curve bounds from statistical mechanics
Machine Learning | 1997-05-06 | Paper |
scientific article; zbMATH DE number 940825 (Why is no real title available?)
| 1996-12-04 | Paper |
A generalization of Sauer's lemma
Journal of Combinatorial Theory. Series A | 1996-02-11 | Paper |
Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
Journal of Combinatorial Theory. Series A | 1995-08-07 | Paper |
The size of \(k\)-pseudotrees
Discrete Mathematics | 1995-07-24 | Paper |
Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions
Journal of Computer and System Sciences | 1995-06-08 | Paper |
Predicting \(\{ 0,1\}\)-functions on randomly drawn points
Information and Computation | 1995-02-16 | Paper |
Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension
Machine Learning | 1994-03-03 | Paper |
Decision theoretic generalizations of the PAC model for neural net and other learning applications
Information and Computation | 1993-01-16 | Paper |
scientific article; zbMATH DE number 67635 (Why is no real title available?)
| 1992-09-27 | Paper |
scientific article; zbMATH DE number 67613 (Why is no real title available?)
| 1992-09-27 | Paper |
Equivalence of models for polynomial learnability
Information and Computation | 1992-06-28 | Paper |
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM | 1989-01-01 | Paper |
A general lower bound on the number of examples needed for learning
Information and Computation | 1989-01-01 | Paper |
Average sizes of suffix trees and DAWGs
Discrete Applied Mathematics | 1989-01-01 | Paper |
Learning decision trees from random examples
Information and Computation | 1989-01-01 | Paper |
Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
Artificial Intelligence | 1988-01-01 | Paper |
A new distance metric on strings computable in linear time
Discrete Applied Mathematics | 1988-01-01 | Paper |
\(\epsilon\)-nets and simplex range queries
Discrete \& Computational Geometry | 1987-01-01 | Paper |
Occam's razor
Information Processing Letters | 1987-01-01 | Paper |
Quasi-Monotonic Sequences: Theory, Algorithms and Applications
SIAM Journal on Algebraic Discrete Methods | 1987-01-01 | Paper |
Applications of an infinite square-free co-CFL
Theoretical Computer Science | 1987-01-01 | Paper |
On total regulators generated by derivation relations
Theoretical Computer Science | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3972211 (Why is no real title available?)
| 1985-01-01 | Paper |
Another generalization of Higman's well quasi order result on \(\Sigma ^*\)
Discrete Mathematics | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3911731 (Why is no real title available?)
| 1985-01-01 | Paper |
On the complexity of iterated shuffle
Journal of Computer and System Sciences | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3883638 (Why is no real title available?)
| 1984-01-01 | Paper |
On DOS languages and DOS mappings
Semigroup Forum | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3902061 (Why is no real title available?)
| 1984-01-01 | Paper |
Insertion languages
Information Sciences | 1983-01-01 | Paper |
On regularity of context-free languages
Theoretical Computer Science | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3780588 (Why is no real title available?)
| 1982-01-01 | Paper |
Model Completeness of an Algebra of Languages
| 1981-01-01 | Paper |
Very special languages and representations of recursively enumerable languages via computation histories
Information and Control | 1980-01-01 | Paper |
