Learning Integer Lattices
- 1 January 1990
- book chapter
- Published by Elsevier
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Equivalence Queries and Approximate FingerprintsPublished by Elsevier ,1989
- LEARNING NESTED DIFFERENCES OF INTERSECTION-CLOSED CONCEPT CLASSESPublished by Elsevier ,1989
- Planning and learning in permutation groupsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Queries and concept learningMachine Learning, 1988
- Learning quickly when irrelevant attributes abound: A new linear-threshold algorithmMachine Learning, 1988
- On learning Boolean functionsPublished by Association for Computing Machinery (ACM) ,1987
- Algorithms for the Solution of Systems of Linear Diophantine EquationsSIAM Journal on Computing, 1982
- Generalization as searchArtificial Intelligence, 1982
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer MatrixSIAM Journal on Computing, 1979
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971