Pages that link to "Item:Q1897355"
From MaRDI portal
The following pages link to Classification by polynomial surfaces (Q1897355):
Displaying 18 items.
- Quantum query complexity of almost all functions with fixed on-set size (Q347109) (← links)
- Generalization error bounds for the logical analysis of data (Q427877) (← links)
- Gauge groups and data classification. (Q1406139) (← links)
- Partitioning points by parallel planes (Q1827723) (← links)
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- On specifying Boolean functions by labelled examples (Q1897365) (← links)
- Accuracy of techniques for the logical analysis of data (Q1961456) (← links)
- Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity (Q2012049) (← links)
- Asymptotics of the number of 2-threshold functions (Q2051779) (← links)
- A characterization of 2-threshold functions via pairs of prime segments (Q2136278) (← links)
- Learning intersections of halfspaces with a margin (Q2462501) (← links)
- Extremal properties of polynomial threshold functions (Q2475403) (← links)
- On the complexity of computing and learning with multiplicative neural networks (Q2780854) (← links)
- An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}<sup>n</sup> (Q3421386) (← links)
- Classification of Surfaces (Q3704621) (← links)
- Neural Networks with Local Receptive Fields and Superlinear VC Dimension (Q4330677) (← links)
- Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors (Q5025767) (← links)
- Hadamard powers and kernel perceptrons (Q6103360) (← links)
