On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes
From MaRDI portal
Publication:817830
DOI10.1016/J.TCS.2005.10.015zbMATH Open1086.68115OpenAlexW2074760215MaRDI QIDQ817830FDOQ817830
Authors: Jürgen Forster, Hans Ulrich Simon
Publication date: 20 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.015
Recommendations
Cites Work
- Matrix Analysis
- Extensions of Lipschitz mappings into a Hilbert space
- Title not available (Why is that?)
- Title not available (Why is that?)
- The variation of the spectrum of a normal matrix
- Title not available (Why is that?)
- Improved lower bounds on the rigidity of Hadamard matrices
- Probabilistic communication complexity
- 10.1162/153244303321897681
- Title not available (Why is that?)
- The Johnson-Lindenstrauss lemma and the sphericity of some graphs
- Title not available (Why is that?)
Cited In (8)
- 10.1162/153244303321897681
- Unbounded-Error Classical and Quantum Communication Complexity
- Title not available (Why is that?)
- The unbounded-error communication complexity of symmetric functions
- Sign rank versus Vapnik-Chervonenkis dimension
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning complexity vs communication complexity
This page was built for publication: On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817830)