关注
Nader H. Bshouty
Nader H. Bshouty
在 cs.technion.ac.il 的电子邮件经过验证
标题
引用次数
引用次数
年份
Vector sets for exhaustive testing of logic circuits
G Seroussi, NH Bshouty
IEEE Transactions on Information Theory 34 (3), 513-522, 1988
2521988
Oracles and queries that are sufficient for exact learning
NH Bshouty, R Cleve, S Kannan, C Tamon
Proceedings of the seventh annual conference on Computational learning …, 1994
2431994
Exact learning boolean functions via the monotone theory
NH Bshouty
Information and Computation 123 (1), 146-153, 1995
2081995
Learning DNF over the uniform distribution using a quantum example oracle
NH Bshouty, JC Jackson
Proceedings of the eighth annual conference on Computational learning theory …, 1995
1691995
On the Fourier spectrum of monotone functions
NH Bshouty, C Tamon
Journal of the ACM (JACM) 43 (4), 747-770, 1996
1611996
Learning functions represented as multiplicity automata
A Beimel, F Bergadano, NH Bshouty, E Kushilevitz, S Varricchio
Journal of the ACM (JACM) 47 (3), 506-530, 2000
1502000
Exact learning via the monotone theory
NH Bshouty
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 302-311, 1993
1371993
Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem
NH Bshouty, L Burroughs
STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science …, 1998
1091998
PAC learning with nasty noise
NH Bshouty, N Eiron, E Kushilevitz
Theoretical Computer Science 288 (2), 255-275, 2002
1002002
On using extended statistical queries to avoid membership queries
NH Bshouty, V Feldman
Journal of Machine Learning Research 2 (Feb), 359-395, 2002
1002002
Learning arithmetic read-once formulas
NH Bshouty, TR Hancock, L Hellerstein
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992
761992
Optimal Algorithms for the Coin Weighing Problem with a Spring Scale.
NH Bshouty
COLT 2009, 82, 2009
752009
Simple learning algorithms using divide and conquer
NH Bshouty
Proceedings of the eighth annual conference on Computational learning theory …, 1995
671995
Attribute-efficient learning in query and mistake-bound models
NH Bshouty, L Hellerstein
Proceedings of the ninth annual conference on Computational learning theory …, 1996
641996
Asking questions to minimize errors
NH Bshouty, SA Goldman, TR Hancock, S Matar
Proceedings of the sixth annual conference on Computational learning theory …, 1993
641993
On the applications of multiplicity automata in learning
A Beimel, F Bergadano, NH Bshouty, E Kushilevitz, S Varricchio
Proceedings of 37th Conference on Foundations of Computer Science, 349-358, 1996
581996
Addition requirements for matrix and transposed matrix products
M Kaminski, DG Kirkpatrick, NH Bshouty
Journal of Algorithms 9 (3), 354-364, 1988
581988
Learning DNF from random walks
NH Bshouty, E Mossel, R O’Donnell, RA Servedio
Journal of Computer and System Sciences 71 (3), 250-265, 2005
532005
Learning boolean read-once formulas with arbitrary symmetric and constant fan-in gates
NH Bshouty, TR Hancock, L Hellerstein
Proceedings of the fifth annual workshop on Computational learning theory, 1-15, 1992
531992
More efficient PAC-learning of DNF with membership queries under the uniform distribution
NH Bshouty, JC Jackson, C Tamon
Proceedings of the Twelfth Annual Conference on Computational Learning …, 1999
511999
系统目前无法执行此操作,请稍后再试。
文章 1–20