The following pages link to Hans Ulrich Simon (Q249069):
Displayed 50 items.
- Supervised learning and co-training (Q391741) (← links)
- Regular languages viewed from a graph-theoretic perspective (Q515689) (← links)
- How many missing answers can be tolerated by query learners? (Q705064) (← links)
- On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes (Q817830) (← links)
- Efficient computation of approximate isomorphisms between Boolean functions (Q903194) (← links)
- One-inclusion hypergraph density revisited (Q991799) (← links)
- (Q1104727) (redirect page) (← links)
- How robust is the n-cube? (Q1104728) (← links)
- Continuous reductions among combinatorial optimization problems (Q1112622) (← links)
- Worst-case analysis of heuristics for the local microcode optimization problem (Q1119463) (← links)
- The Vapnik-Chervonenkis dimension of decision trees with bounded rank (Q1182084) (← links)
- Using computational learning strategies as a tool for combinatorial optimization (Q1267770) (← links)
- On restricted-focus-of-attention learnability of Boolean functions (Q1383194) (← links)
- Estimating the optimal margins of embeddings in Euclidean half spaces (Q1394789) (← links)
- How many queries are needed to learn one bit of information? (Q1404413) (← links)
- (Q1567398) (redirect page) (← links)
- Structural results about exact learning with unspecified attribute values (Q1567399) (← links)
- The computational complexity of densest region detection (Q1604217) (← links)
- Hierarchical design of fast minimum disagreement algorithms (Q1704562) (← links)
- On the teaching complexity of linear sets (Q1704564) (← links)
- Probably almost Bayes decisions (Q1817223) (← links)
- Pattern matching in trees and nets (Q1836979) (← links)
- General lower bounds on the query complexity within the exact learning model (Q1841883) (← links)
- The consistency dimension and distribution-dependent learning from queries. (Q1853513) (← links)
- Robust trainability of single neurons (Q1892210) (← links)
- General bounds on the number of examples needed for learning probabilistic concepts (Q1916527) (← links)
- PAC-learning in the presence of one-sided classification~noise (Q2254605) (← links)
- Discriminative learning can succeed where generative learning fails (Q2379956) (← links)
- On the complexity of working set selection (Q2381582) (← links)
- Distinguishing pattern languages with membership examples (Q2407113) (← links)
- A lower bound on the release of differentially private integer partitions (Q2410571) (← links)
- Smart PAC-learners (Q2431423) (← links)
- Threshold circuit lower bounds on cryptographic functions (Q2485284) (← links)
- Learning Deterministic Finite Automata from Smallest Counterexamples (Q2706180) (← links)
- On the Teaching Complexity of Linear Sets (Q2835620) (← links)
- Hierarchical Design of Fast Minimum Disagreement Algorithms (Q2835623) (← links)
- Order Compression Schemes (Q2859215) (← links)
- Boolean Composition of Visual Secret Sharing Schemes (Q2907511) (← links)
- (Q2934114) (← links)
- Unlabeled Data Does Provably Help (Q2957883) (← links)
- (Q3048248) (← links)
- Complexity Theoretic Aspects of Some Cryptographic Functions (Q3082937) (← links)
- (Q3093301) (← links)
- Supervised Learning and Co-training (Q3093969) (← links)
- (Q3148796) (← links)
- Sample-efficient strategies for learning in the presence of noise (Q3158555) (← links)
- (Q3174081) (← links)
- (Q3321490) (← links)
- A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functions (Q3326839) (← links)
- (Q3338110) (← links)