Jürgen Forster
According to our database1,
Jürgen Forster
authored at least 11 papers
between 1999 and 2006.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2006
On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes.
Theor. Comput. Sci., 2006
2003
Mach. Learn., 2003
2002
On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution.
Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution.
Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002
2001
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity.
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001
Proceedings of the Computational Learning Theory, 2001
Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001
2000
Relative Loss Bounds for Temporal-Difference Learning.
Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), Stanford University, Stanford, CA, USA, June 29, 2000
Relative Expected Instantaneous Loss Bounds.
Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000
1999
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999
Proceedings of the Computational Learning Theory, 4th European Conference, 1999