Hans Ulrich Simon

Navedeno

	Vse	Od leta 2019
Navedbe	2939	652
indeks h	28	15
indeks i10	58	21

160

120

1987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202410 14 17 24 28 35 28 60 42 45 42 63 48 34 54 65 64 68 102 83 117 98 85 99 87 97 92 144 103 137 122 123 110 112 106 124 102 98

Javni dostop

Prikaži vse

18 člankov

1 članek

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Sandra ZillesProfessor, Computer Science, University of ReginaPreverjeni e-poštni naslov na cs.uregina.ca
Shai Ben-DavidUniverity of Waterloo, CanadaPreverjeni e-poštni naslov na uwaterloo.ca
Paul FischerDTU Compute, Technical University of DenmarkPreverjeni e-poštni naslov na dtu.dk
Niels SchmittPreverjeni e-poštni naslov na sap.com
Bernd BeckerProfessor of Computer Science, University of FreiburgPreverjeni e-poštni naslov na informatik.uni-freiburg.de
Nicolò Cesa-BianchiProfessor of Computer Science, Università degli Studi di Milano and Politecnico di MilanoPreverjeni e-poštni naslov na unimi.it
Jorge CastroLarca Research Group. LSI Departament. UPCPreverjeni e-poštni naslov na lsi.upc.edu
Jose L. BalcazarProfessor, Computer Science, Universitat Politècnica de CatalunyaPreverjeni e-poštni naslov na upc.edu
Balazs SzorenyiSr Research Scientist at Yahoo ResearchPreverjeni e-poštni naslov na yahooinc.com
Dávid PálStaff Machine Learning Engineer, InstacartPreverjeni e-poštni naslov na instacart.com
Eike KiltzProfessor of Computer Science, Ruhr-Universität BochumPreverjeni e-poštni naslov na rub.de
Jeffrey C. JacksonProfessor of Computer Science, Duquesne UniversityPreverjeni e-poštni naslov na duq.edu

Spremljaj

Hans Ulrich Simon

Retired Professor, Dept. of Math., Ruhr-University Bochum

Preverjeni e-poštni naslov na rub.de

Computational Learning Complexity Theory Efficient Algorithms Combinatorial Optimization


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Robust trainability of single neurons KU Höffgen, HU Simon Proceedings of the fifth annual workshop on Computational learning theory …, 1992	260	1992
How robust is the n-cube? B Becker, HU Simon Information and Computation 77 (2), 162-178, 1988	218	1988
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	213	2000
On approximate solutions for combinatorial optimization problems HU Simon SIAM Journal on Discrete Mathematics 3 (2), 294-310, 1990	134	1990
Stability of k-Means Clustering S Ben-David, D Pál, HU Simon Learning Theory: 20th Annual Conference on Learning Theory, COLT 2007, San …, 2007	131	2007
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	118	1983
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	114	2001
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	109	2002
General bounds on the number of examples needed for learning probabilistic concepts HU Simon Proceedings of the sixth annual conference on Computational learning theory …, 1993	84	1993
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	79	2014
On learning ring-sum-expansions P Fischer, HU Simon SIAM Journal on Computing 21 (1), 181-192, 1992	65	1992
Determining the optimal contrast for secret sharing schemes in visual cryptography M Krause, HU Simon Combinatorics, Probability and Computing 12 (3), 285-299, 2003	62	2003
Contrast-optimal k out of n secret sharing schemes in visual cryptography T Hofmeister, M Krause, HU Simon Computing and Combinatorics: Third Annual International Conference, COCOON …, 1997	62	1997
Preference-based teaching Z Gao, C Ries, HU Simon Journal of Machine Learning Research 18 (31), 1-32, 2017	48	2017
SVM-optimization and steepest-descent line search N List, HU Simon Proceedings of the 22nd Annual Conference on Computational Learning Theory, 2009	46	2009
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	46	1999
A general convergence theorem for the decomposition method N List, HU Simon International Conference on Computational Learning Theory, 363-377, 2004	43	2004
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	43	2003
Efficient learning of linear perceptrons S Ben-David, HU Simon Advances in Neural Information Processing Systems 13, 2000	41	2000
Learning decision lists and trees with equivalence-queries HU Simon European Conference on Computational Learning Theory, 322-336, 1995	41	1995

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji