The following pages link to (Q4004178):
Displaying 36 items.
- On specifying Boolean functions by labelled examples (Q1897365) (← links)
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers (Q1900973) (← links)
- Independence number and the complexity of families of sets (Q1918552) (← links)
- Accuracy of techniques for the logical analysis of data (Q1961456) (← links)
- Inner-core and outer-core functions of partially defined Boolean functions (Q1961465) (← links)
- Canonical forest (Q2259759) (← links)
- Quadratic boosting (Q2384982) (← links)
- Classification based on prototypes with spheres of influence (Q2407114) (← links)
- A hybrid classifier based on boxes and nearest neighbors (Q2449121) (← links)
- On two-stage convex chance constrained problems (Q2466772) (← links)
- Aspects of discrete mathematics and probability in the theory of machine learning (Q2478432) (← links)
- Ambiguous chance constrained problems and robust optimization (Q2492682) (← links)
- On the fusion of threshold classifiers for categorization and dimensionality reduction (Q2513348) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Theory of Classification: a Survey of Some Recent Advances (Q3373749) (← links)
- Learning Theory (Q3426914) (← links)
- (Q3484380) (← links)
- (Q4000319) (← links)
- Learning deterministic regular grammars from stochastic samples in polynomial time (Q4256139) (← links)
- Using the Perceptron Algorithm to Find Consistent Hypotheses (Q4290090) (← links)
- Generating dual-bounded hypergraphs (Q4405941) (← links)
- COMPLEXITY: METRICS AND MODULES (Q4671142) (← links)
- (Q4692793) (← links)
- Valid Generalisation from Approximate Interpolation (Q4715266) (← links)
- Perceptrons with polynomial post-processing (Q4779485) (← links)
- Ten More Years of Error Rate Research (Q4831978) (← links)
- (Q4892198) (← links)
- Neural networks and some applications to finance (Q4994396) (← links)
- Random Projections for Linear Programming (Q5219688) (← links)
- Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems (Q5426871) (← links)
- A lower bound for families of Natarajan dimension \(d\) (Q5940311) (← links)
- Monotone term decision lists (Q5941293) (← links)
- Probabilistic solutions to some NP-hard matrix problems (Q5947649) (← links)
- Decision lists and related Boolean functions (Q5958318) (← links)
- On the non-efficient PAC learnability of conjunctive queries (Q6072217) (← links)
- A fast and simple algorithm for identifying 2-monotonic positive Boolean functions (Q6487975) (← links)
