On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution
- 8 November 2002
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 128-138
- https://doi.org/10.1007/3-540-36169-3_12
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Relations Between Communication Complexity, Linear Arrangements, and Computational ComplexityLecture Notes in Computer Science, 2001
- Estimating the Optimal Margins of Embeddings in Euclidean Half SpacesLecture Notes in Computer Science, 2001
- Limitations of Learning via Embeddings in Euclidean Half-SpacesLecture Notes in Computer Science, 2001
- Improved lower bounds on the rigidity of Hadamard matricesMathematical Notes, 1998
- A training algorithm for optimal margin classifiersPublished by Association for Computing Machinery (ACM) ,1992
- Topics in Matrix AnalysisPublished by Cambridge University Press (CUP) ,1991
- The Johnson-Lindenstrauss lemma and the sphericity of some graphsJournal of Combinatorial Theory, Series B, 1988
- Matrix AnalysisPublished by Cambridge University Press (CUP) ,1985
- Extensions of Lipschitz mappings into a Hilbert spacePublished by American Mathematical Society (AMS) ,1984
- The variation of the spectrum of a normal matrixDuke Mathematical Journal, 1953