| 2006 |
|---|
| 14 | EE | Jürgen Forster,
Hans-Ulrich Simon:
On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes.
Theor. Comput. Sci. 350(1): 40-48 (2006) |
| 2003 |
|---|
| 13 | | Jürgen Forster,
Manfred K. Warmuth:
Relative Loss Bounds for Temporal-Difference Learning.
Machine Learning 51(1): 23-50 (2003) |
| 12 | EE | Jürgen Forster,
Niels Schmitt,
Hans-Ulrich Simon,
Thorsten Suttorp:
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces.
Machine Learning 51(3): 263-281 (2003) |
| 2002 |
|---|
| 11 | EE | Jürgen Forster,
Hans-Ulrich Simon:
On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution.
ALT 2002: 128-138 |
| 10 | EE | Dietrich Braess,
Jürgen Forster,
Tomas Sauer,
Hans-Ulrich Simon:
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution.
ALT 2002: 380-394 |
| 9 | EE | Jürgen Forster,
Manfred K. Warmuth:
Relative Expected Instantaneous Loss Bounds.
J. Comput. Syst. Sci. 64(1): 76-102 (2002) |
| 8 | EE | Jürgen Forster:
A linear lower bound on the unbounded error probabilistic communication complexity.
J. Comput. Syst. Sci. 65(4): 612-625 (2002) |
| 2001 |
|---|
| 7 | EE | Jürgen Forster,
Niels Schmitt,
Hans-Ulrich Simon:
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces.
COLT/EuroCOLT 2001: 402-415 |
| 6 | EE | Jürgen Forster,
Matthias Krause,
Satyanarayana V. Lokam,
Rustam Mubarakzjanov,
Niels Schmitt,
Hans-Ulrich Simon:
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity.
FSTTCS 2001: 171-182 |
| 5 | EE | Jürgen Forster:
A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity.
IEEE Conference on Computational Complexity 2001: 100-106 |
| 2000 |
|---|
| 4 | | Jürgen Forster,
Manfred K. Warmuth:
Relative Expected Instantaneous Loss Bounds.
COLT 2000: 90-99 |
| 3 | | Jürgen Forster,
Manfred K. Warmuth:
Relative Loss Bounds for Temporal-Difference Learning.
ICML 2000: 295-302 |
| 1999 |
|---|
| 2 | EE | Jürgen Forster:
Learning Multiplicity Automata from Smallest Counterexamples.
EuroCOLT 1999: 79-90 |
| 1 | EE | Jürgen Forster:
On Relative Loss Bounds in Generalized Linear Regression.
FCT 1999: 269-280 |
