| Finite-time analysis of the multiarmed bandit problem P Auer, N Cesa-Bianchi, P Fischer Machine learning 47, 235-256, 2002 | 8015 | 2002 |
| Finite-time regret bounds for the multiarmed bandit problem. N Cesa-Bianchi, P Fischer ICML 98, 100-108, 1998 | 126 | 1998 |
| On learning ring-sum-expansions P Fischer, HU Simon SIAM Journal on Computing 21 (1), 181-192, 1992 | 63 | 1992 |
| The complexity of computing the MCD-estimator T Bernholt, P Fischer Theoretical Computer Science 326 (1-3), 383-398, 2004 | 50 | 2004 |
| Sample-efficient strategies for learning in the presence of noise N Cesa-Bianchi, E Dichterman, P Fischer, E Shamir, HU Simon Journal of the ACM (JACM) 46 (5), 684-719, 1999 | 42 | 1999 |
| Comparison between various regression depth methods and the support vector machine to approximate the minimum number of misclassifications A Christmann, P Fischer, T Joachims Computational Statistics 17 (2), 273-287, 2002 | 40 | 2002 |
| On the cut-off point for combinatorial group testing P Fischer, N Klasner, I Wegener Discrete applied mathematics 91 (1), 83-92, 1999 | 35 | 1999 |
| Computing a maximum axis-aligned rectangle in a convex polygon P Fischer, KU Höffgen Information Processing Letters 51 (4), 189-193, 1994 | 23 | 1994 |
| Sequential and parallel algorithms for finding a maximum convex polygon P Fischer Computational Geometry 7 (3), 187-200, 1997 | 20 | 1997 |
| Exploiting random walks for learning PL Bartlett, P Fischer, KU Höffgen Proceedings of the Seventh Annual Conference on Computational Learning …, 1994 | 17 | 1994 |
| More or less efficient agnostic learning of convex polygons P Fischer Proceedings of the eighth annual conference on Computational learning theory …, 1995 | 15 | 1995 |
| Finding maximum convex polygons P Fischer International Symposium on Fundamentals of Computation Theory, 234-243, 1993 | 15 | 1993 |
| Probably almost Bayes decisions P Fischer, S Pölt, HU Simon Dekanat Informatik, Univ., 1991 | 13 | 1991 |
| Algorithmisches Lernen P Fischer Springer-Verlag, 2013 | 10 | 2013 |
| Pairs without infimum in the recursively enumerable weak truth table degrees P Fischer The Journal of symbolic logic 51 (1), 117-129, 1986 | 9 | 1986 |
| An introduction to graphical user interfaces with Java Swing P Fischer Pearson Education, 2005 | 8 | 2005 |
| Probably almost Bayes decisions S Anoulova, P Fischer, S Pölt, HU Simon information and computation 129 (1), 63-71, 1996 | 8 | 1996 |
| Approximations with axis-aligned rectangles P Fischer, KU Höffgen, H Lefmann, T Luczak Fundamentals of Computation Theory: 9th International Conference, FCT'93 …, 1993 | 8 | 1993 |
| Noise-tolerant learning near the information-theoretic bound N Cesa-Bianchi, E Dichterman, P Fischer, HU Simon Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing …, 1996 | 7 | 1996 |
| PAB-Decisions for boolean and real-valued features S Anoulova, P Fischer, S Pölt, HU Simon Proceedings of the fifth annual workshop on Computational learning theory …, 1992 | 7 | 1992 |
Carsten WittTechnical University of DenmarkDirección de correo verificada de imm.dtu.dk
