The following pages link to Paul Fischer (Q196055):
Displayed 27 items.
- Sequential and parallel algorithms for finding a maximum convex polygon (Q676573) (← links)
- The complexity of computing the MCD-estimator (Q703560) (← links)
- On the cut-off point for combinatorial group testing (Q1283788) (← links)
- Computing a maximum axis-aligned rectangle in a convex polygon (Q1334640) (← links)
- PAC-learning from general examples (Q1392015) (← links)
- Probably almost Bayes decisions (Q1817223) (← links)
- Exploiting random walks for learning (Q1854545) (← links)
- Comparison between various regression depth methods and the support vector machine to approximate the minimum number of misclassifications (Q1855638) (← links)
- Trial and error: A new approach to space-bounded learning (Q1901711) (← links)
- (Q3078231) (← links)
- Edge-Matching Problems with Rotations (Q3088275) (← links)
- Sample-efficient strategies for learning in the presence of noise (Q3158555) (← links)
- (Q3197312) (← links)
- (Q3295310) (← links)
- Classification Based on the Support Vector Machine, Regression Depth, and Discriminant Analysis (Q3298682) (← links)
- Pairs without infimum in the recursively enumerable weak truth table degrees (Q3714068) (← links)
- On Learning Ring-Sum-Expansions (Q3990109) (← links)
- (Q4028120) (← links)
- (Q4228464) (← links)
- (Q4284244) (← links)
- (Q4284245) (← links)
- (Q4704224) (← links)
- (Q4726237) (← links)
- (Q5324458) (← links)
- A lower bound for families of Natarajan dimension \(d\) (Q5940311) (← links)
- Finite-time analysis of the multiarmed bandit problem (Q5959973) (← links)
- First Steps Towards a Runtime Analysis of Neuroevolution (Q6120967) (← links)