Jürgen Forster

According to our database, Jürgen Forster authored at least 11 papers between 1999 and 2006.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2006

On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes.

Jürgen Forster, Hans Ulrich Simon

Theor. Comput. Sci., 2006

2003

Relative Loss Bounds for Temporal-Difference Learning.

Jürgen Forster, Manfred K. Warmuth

Mach. Learn., 2003

Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces.

Jürgen Forster, Niels Schmitt, Hans Ulrich Simon, Thorsten Suttorp

Mach. Learn., 2003

2002

Relative Expected Instantaneous Loss Bounds.

Jürgen Forster, Manfred K. Warmuth

J. Comput. Syst. Sci., 2002

A linear lower bound on the unbounded error probabilistic communication complexity.

Jürgen Forster

J. Comput. Syst. Sci., 2002

On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution.

Jürgen Forster, Hans Ulrich Simon

Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002

How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution.

Dietrich Braess, Jürgen Forster, Tomas Sauer, Hans Ulrich Simon

Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002

2001

Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity.

Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans Ulrich Simon

Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces.

Jürgen Forster, Niels Schmitt, Hans Ulrich Simon

Proceedings of the Computational Learning Theory, 2001

1999

On Relative Loss Bounds in Generalized Linear Regression.

Jürgen Forster

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Learning Multiplicity Automata from Smallest Counterexamples.

Jürgen Forster

Proceedings of the Computational Learning Theory, 4th European Conference, 1999