Follow
Paul Fischer
Paul Fischer
Verified email at dtu.dk
Title
Cited by
Cited by
Year
Finite-time regret bounds for the multiarmed bandit problem.
N Cesa-Bianchi, P Fischer
ICML 98, 100-108, 1998
1281998
On learning ring-sum-expansions
P Fischer, HU Simon
SIAM Journal on Computing 21 (1), 181-192, 1992
651992
The complexity of computing the MCD-estimator
T Bernholt, P Fischer
Theoretical Computer Science 326 (1-3), 383-398, 2004
512004
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
451999
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
402002
On the cut-off point for combinatorial group testing
P Fischer, N Klasner, I Wegener
Discrete applied mathematics 91 (1), 83-92, 1999
351999
Computing a maximum axis-aligned rectangle in a convex polygon
P Fischer, KU Höffgen
Information Processing Letters 51 (4), 189-193, 1994
241994
Sequential and parallel algorithms for finding a maximum convex polygon
P Fischer
Computational Geometry 7 (3), 187-200, 1997
201997
Exploiting random walks for learning
PL Bartlett, P Fischer, KU Höffgen
Proceedings of the Seventh Annual Conference on Computational Learning …, 1994
181994
More or less efficient agnostic learning of convex polygons
P Fischer
Proceedings of the eighth annual conference on Computational learning theory …, 1995
161995
Finding maximum convex polygons
P Fischer
International Symposium on Fundamentals of Computation Theory, 234-243, 1993
141993
Probably almost Bayes decisions
P Fischer, S Pölt, HU Simon
Dekanat Informatik, Univ., 1991
141991
Algorithmisches Lernen
P Fischer
Springer-Verlag, 2013
112013
An introduction to graphical user interfaces with Java Swing
P Fischer
Pearson Education, 2005
92005
Approximations with axis-aligned rectangles
P Fischer, KU Höffgen, H Lefmann, T Luczak
Fundamentals of Computation Theory: 9th International Conference, FCT'93 …, 1993
91993
Pairs without infimum in the recursively enumerable weak truth table degrees
P Fischer
The Journal of symbolic logic 51 (1), 117-129, 1986
91986
Probably almost Bayes decisions
S Anoulova, P Fischer, S Pölt, HU Simon
information and computation 129 (1), 63-71, 1996
81996
Exploiting random walks for learning
PL Bartlett, P Fischer, KU Höffgen
Information and Computation 176 (2), 121-135, 2002
72002
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
71996
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
71992
The system can't perform the operation now. Try again later.
Articles 1–20