☰

Nader Bshouty - Publications

Affiliations: 
University of Calgary, Calgary, Alberta, Canada 
Area:
Computer Science

53 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2015 Abasi H, Bshouty NH, Mazzawi H. Non-adaptive learning of a hidden hypergraph Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9355: 89-101. DOI: 10.1007/978-3-319-24486-0_6  0.452
2014 Abasi H, Bshouty NH, Gabizon A, Haramaty E. On r-simple k-path Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8635: 1-12. DOI: 10.1007/978-3-662-44465-8_1  0.307
2014 Abasi H, Bshouty NH, Mazzawi H. On exact learning monotone DNF from membership queries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8776: 111-124.  0.471
2014 Abasi H, Abdi AZ, Bshouty NH. Learning boolean halfspaces with small weights from membership queries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8776: 96-110.  0.418
2013 Bshouty NH. Exact learning from membership queries: Some techniques, results and new directions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8139: 33-52. DOI: 10.1007/978-3-642-40935-6_4  0.466
2012 Bshouty NH, Stoltz G, Vayatis N, Zeugmann T. Editors' introduction Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7568: 1-11. DOI: 10.1007/978-3-642-34106-9_1  0.478
2012 Bshouty NH. On the coin weighing problem with the presence of noise Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7408: 471-482. DOI: 10.1007/978-3-642-32512-0_40  0.328
2011 Bshouty NH, Mazzawi H. Reconstructing weighted graphs with minimal query complexity Theoretical Computer Science. 412: 1782-1790. DOI: 10.1016/j.tcs.2010.12.055  0.306
2009 Bshouty NH, Li Y, Long PM. Using the doubling dimension to analyze the generalization of learning algorithms Journal of Computer and System Sciences. 75: 323-335. DOI: 10.1016/j.jcss.2009.01.003  0.416
2009 Bshouty NH. Optimal algorithms for the coin weighing problem with a spring scale Colt 2009 - the 22nd Conference On Learning Theory 0.39
2008 Bisht L, Bshouty NH, Khoury L. Learning with errors in answers to membership queries Journal of Computer and System Sciences. 74: 2-15. DOI: 10.1016/j.jcss.2007.04.010  0.545
2008 Bshouty NH, Gentile C. Guest editors' introduction: Special issue on learning theory (COLT-2007) Machine Learning. 72: 1-4. DOI: 10.1007/s10994-008-5062-x  0.354
2007 Bennet R, Bshouty NH. Learning attribute-efficiently with corrupt oracles Theoretical Computer Science. 387: 32-50. DOI: 10.1016/j.tcs.2007.07.040  0.514
2006 Bshouty NH, Mazzawi H. Exact learning composed classes with a small number of mistakes Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4005: 199-213.  0.509
2006 Bisht L, Bshouty NH, Mazzawi H. On optimal learning algorithms for multiplicity automata Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4005: 184-198.  0.428
2006 Bshouty NH, Bentov I. On exact learning from random walk Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4264: 184-198.  0.488
2006 Bshouty NH, Wattad E. On exact learning halfspaces with random consistent hypothesis oracle Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4264: 48-62.  0.488
2005 Bshouty NH, Mossel E, O'Donnell R, Servedio RA. Learning DNF from random walks Journal of Computer and System Sciences. 71: 250-265. DOI: 10.1016/j.jcss.2004.10.010  0.525
2005 Bshouty NH, Burroughs L. Maximizing agreements with one-sided error with applications to heuristic learning Machine Learning. 59: 99-123. DOI: 10.1007/S10994-005-0464-5  0.466
2004 Bshouty NH, Burroughs L. On the proper learning of axis-parallel concepts Journal of Machine Learning Research. 4: 157-176. DOI: 10.1162/153244304322972676  0.469
2004 Bisht L, Bshouty NH, Khoury L. Learning with errors in answers to membership queries (extended abstract) Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 611-620. DOI: 10.1109/FOCS.2004.37  0.584
2004 Bshouty NH, Jackson JC, Tamon C. More efficient PAC-learning of DNF with membership queries under the uniform distribution Journal of Computer and System Sciences. 68: 205-234. DOI: 10.1016/j.jcss.2003.10.002  0.455
2003 Bshouty NH, Eiron N. Learning monotone DNF from a teacher that almost does not answer membership queries Journal of Machine Learning Research. 3: 49-57. DOI: 10.1162/153244303768966094  0.384
2003 Bshouty NH, Jackson JC, Tamon C. Uniform-distribution attribute noise learnability Information and Computation. 187: 277-290. DOI: 10.1016/S0890-5401(03)00135-4  0.366
2003 Bshouty N, Mossel E, O'Donnell R, Servedio RA. Learning DNF from random walks Annual Symposium On Foundations of Computer Science - Proceedings. 189-198.  0.53
2002 Bshouty NH, Feldman V. On Using Extended Statistical Queries to Avoid Membership Queries Journal of Machine Learning Research. 2: 359-395. DOI: 10.1162/153244302760200669  0.427
2002 Bshouty NH, Mansour Y. Simple learning algorithms for decision trees and multivariate polynomials Siam Journal On Computing. 31: 1909-1925. DOI: 10.1137/S009753979732058X  0.531
2002 Bshouty NH, Eiron N, Kushilevitz E. PAC learning with Nasty Noise Theoretical Computer Science. 288: 255-275. DOI: 10.1016/S0304-3975(01)00403-0  0.416
2002 Bshouty NH, Burroughs L. Maximizing agreements and coagnostic learning Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2533: 83-97. DOI: 10.1016/j.tcs.2005.10.014  0.6
2002 Bshouty NH, Jackson JC, Tamon C. Exploring learnability between exact and PAC Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 2375: 244-254. DOI: 10.1016/j.jcss.2004.10.002  0.519
2002 Bshouty NH, Gavinsky D. PAC = PAExact and other equivalent models in learning Annual Symposium On Foundations of Computer Science - Proceedings. 167-176.  0.412
2002 Bshouty NH, Burroughs L. Bounds for the minimum disagreement problem with applications to learning theory Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 2375: 271-286.  0.639
2002 Bshouty NH, Burroughs L. On the proper learning of axis parallel concepts Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 2375: 287-302.  0.648
2001 Bshouty NH, Gavinsky D. On boosting with optimal poly-bounded distributions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2111: 490-506.  0.5
2001 Bshouty NH, Eiron N. Learning monotone DNF from a teacher that almost: Does not answer membership queries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2111: 546-557.  0.392
2001 Bshouty N, Owshanko A. Learning regular sets with an incomplete membership oracle Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2111: 574-588.  0.552
2000 Beimel A, Bergadano F, Bshouty NH, Kushilevitz E, Varricchio S. Learning functions represented as multiplicity automata Journal of the Acm. 47: 506-530.  0.52
1998 Bshouty N, Hellerstein L. Attribute-Efficient Learning in Query and Mistake-Bound Models Journal of Computer and System Sciences. 56: 310-319.  0.438
1998 Bshouty NH. Exact learning of discretized geometric concepts Siam Journal On Computing. 28: 674-699.  0.348
1998 Bshouty NH, Tamon C, Wilson DK. On learning decision trees with large output domains Algorithmica (New York). 20: 77-100.  0.373
1998 Bshouty NH, Goldman SA, Mathias HD. Noise-Tolerant Parallel Learning of Geometric Concepts Information and Computation. 147: 89-110.  0.421
1998 Bshouty NH, Goldman SA, Mathias HD, Suri S, Tamaki H. Noise-Tolerant Distribution-Free Learning of General Geometric Concepts Journal of the Acm. 45: 863-890.  0.383
1997 Bergadano F, Bshouty NH, Tamon C, Varricchio S. On learning branching programs and small depth circuits: (Extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1208: 150-161.  0.399
1997 Bshouty NH, Tamon C, Wilson DK. Learning matrix functions over rings Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1208: 27-37.  0.475
1997 Bshouty NH. Exact learning of formulas in parallel Machine Learning. 26: 25-41.  0.511
1997 Bshouty NH. On learning multivariate polynomials under the uniform distribution Information Processing Letters. 61: 303-309.  0.384
1996 Bshouty NH. A subexponential exact learning algorithm for DNF using equivalence queries Information Processing Letters. 59: 37-39. DOI: 10.1016/0020-0190(96)00077-4  0.446
1996 Bshouty NH, Cleve R, Gavaldà R, Kannan S, Tamon C. Oracles and queries that are sufficient for exact learning Journal of Computer and System Sciences. 52: 421-433. DOI: 10.1006/jcss.1996.0032  0.539
1996 Bshouty NH, Goldman SA, Hancock TR, Matar S. Asking questions to minimize errors Journal of Computer and System Sciences. 52: 268-286. DOI: 10.1006/jcss.1996.0021  0.375
1996 Bshouty NH. Simple learning algorithms using divide and conquer Computational Complexity. 6: 174-194.  0.408
1995 Bshouty NH. Multiplicative complexity of direct sums of quadratic systems Linear Algebra and Its Applications. 215: 183-223. DOI: 10.1016/0024-3795(93)00088-H  0.305
1995 Bshouty NH. Exact Learning Boolean Functions via the Monotone Theory Information and Computation. 123: 146-153. DOI: 10.1006/inco.1995.1164  0.423
1994 Bshouty NH, Hancock TR, Hellerstein L, Karpinski M. An algorithm to learn read-once threshold formulas, and transformations between learning models Computational Complexity. 4: 37-61. DOI: 10.1007/BF01205054  0.395
Show low-probability matches.