Pages that link to "Item:Q1900973"
From MaRDI portal
The following pages link to Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers (Q1900973):
Displayed 17 items.
- A size-depth trade-off for the analog computation of Boolean functions (Q671617) (← links)
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks (Q676431) (← links)
- Neural networks with quadratic VC dimension (Q676433) (← links)
- On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
- Aggregate operators in constraint query languages (Q696963) (← links)
- On the generalization error of fixed combinations of classifiers (Q881592) (← links)
- Dynamical recognizers: real-time language recognition by analog computers (Q1129007) (← links)
- Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes (Q1265741) (← links)
- Vapnik-Chervonenkis dimension of recurrent neural networks (Q1265745) (← links)
- The complexity of model classes, and smoothing noisy data (Q1274410) (← links)
- A learning result for continuous-time recurrent neural networks (Q1274412) (← links)
- Learning distributions by their density levels: A paradigm for learning without a teacher (Q1370866) (← links)
- Partitioning points by parallel planes (Q1827723) (← links)
- On the complexity of learning for spiking neurons with temporal coding. (Q1854302) (← links)
- Learning from rounded-off data. (Q1873753) (← links)
- Theory of Classification: a Survey of Some Recent Advances (Q3373749) (← links)
- Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations (Q3520053) (← links)