Hans Ulrich Simon
Hans Ulrich Simon
Retired Professor, Dept. of Math., Ruhr-University Bochum
Verified email at rub.de
Title
Cited by
Cited by
Year
Robust trainability of single neurons
KU Hoffgen, HU Simon, KS Vanhorn
Journal of Computer and System Sciences 50 (1), 114-125, 1995
2401995
How robust is the n-cube?
B Becker, HU Simon
Information and Computation 77 (2), 162-178, 1988
1971988
Contrast-optimal k out of n secret sharing schemes in visual cryptography
T Hofmeister, M Krause, HU Simon
Theoretical Computer Science 240 (2), 471-485, 2000
1912000
On approximate solutions for combinatorial optimization problems
HU Simon
SIAM Journal on Discrete Mathematics 3 (2), 294-310, 1990
1201990
A tight Ω (loglog n)-bound on the time for parallel Ram's to compute nondegenerated boolean functions
HU Simon
International Conference on Fundamentals of Computation Theory, 439-444, 1983
1111983
Stability of k-Means Clustering
S Ben-David, D Pál, HU Simon
International conference on computational learning theory, 20-34, 2007
992007
Relations between communication complexity, linear arrangements, and computational complexity
J Forster, M Krause, SV Lokam, R Mubarakzjanov, N Schmitt, HU Simon
International Conference on Foundations of Software Technology and …, 2001
992001
Limitations of learning via embeddings in Euclidean half spaces
S Ben-David, N Eiron, HU Simon
Journal of Machine Learning Research 3 (Nov), 441-461, 2002
942002
General bounds on the number of examples needed for learning probabilistic concepts
HU Simon
Journal of Computer and System Sciences 52 (2), 239-254, 1996
711996
Recursive teaching dimension, VC-dimension and sample compression
T Doliwa, G Fan, HU Simon, S Zilles
The Journal of Machine Learning Research 15 (1), 3107-3131, 2014
622014
On learning ring-sum-expansions
P Fischer, HU Simon
SIAM Journal on Computing 21 (1), 181-192, 1992
591992
Determining the optimal contrast for secret sharing schemes in visual cryptography
M Krause, HU Simon
Combinatorics, Probability & Computing 12 (3), 285, 2003
582003
Contrast-optimal k out of n secret sharing schemes in visual cryptography
T Hofmeister, M Krause, HU Simon
International Computing and Combinatorics Conference, 176-185, 1997
571997
SVM-optimization and steepest-descent line search
N List, HU Simon
Proceedings of the 22nd Annual Conference on Computational Learning Theory, 2009
402009
Learning decision lists and trees with equivalence-queries
HU Simon
European Conference on Computational Learning Theory, 322-336, 1995
381995
A general convergence theorem for the decomposition method
N List, HU Simon
International Conference on Computational Learning Theory, 363-377, 2004
352004
Estimating the optimal margins of embeddings in euclidean half spaces
J Forster, N Schmitt, HU Simon, T Suttorp
Machine Learning 51 (3), 263-281, 2003
352003
Efficient learning of linear perceptrons
S Ben-David, HU Simon
Advances in Neural Information Processing Systems, 189-195, 2001
342001
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
331999
On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes
J Forster, HU Simon
Theoretical Computer Science 350 (1), 40-48, 2006
312006
The system can't perform the operation now. Try again later.
Articles 1–20