Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Simon, Hans Ulrich - Fakultät für Mathematik, Ruhr-Universität Bochum
On the Complexity of Working Set Selection # Hans Ulrich Simon
Recursive Teaching Dimension, Learning Complexity, and Maximum Classes #
Journal of Machine Learning Research 1 (2006) Submitted 02/06; Revised 10/06; Published General Polynomial Time
Discriminative Learning can Succeed where Generative Learning Fails #
Oneinclusion Hypergraph Density Revisited I Hans Ulrich Simon a , Balazs Szorenyi a,b
SVMOptimization and SteepestDescent Line Search # Nikolas List and Hans Ulrich Simon
A Characterization of Strong Learnability in the Statistical Query Model #
Dimension and Margin Bounds for Reflectioninvariant Kernels #
One-inclusion Hypergraph Density Revisited Hans Ulrich Simon and Balazs Szorenyi
Smart PACLearners # Hans Ulrich Simon
Stability of kMeans Clustering Shai BenDavid 1 , David Pal 1 , and Hans Ulrich Simon 2#
A Close Look to Margin Complexity and Related Parameters Michael Kallweit
Smart PACLearners # Malte Darnstadt and Hans Ulrich Simon
Supervised Learning and Cotraining # Malte Darnstadt 1 , Hans Ulrich Simon 1 , and Balazs Szorenyi 2
Boolean Composition of Visual Secret Sharing Schemes
