| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Nader H. Bshouty |
Testers and their Applications.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Hanna Mazzawi |
Toward a deterministic polynomial time algorithm with optimal additive query complexity. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Philip M. Long |
Linear classifiers are nearly optimal when hidden variables have diverse effects. |
Machine Learning |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Hanna Mazzawi |
Algorithms for the Coin Weighing Problems with the Presence of Noise. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Hanna Mazzawi |
Reconstructing weighted graphs with minimal query complexity. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Hanna Mazzawi |
On Parity Check (0, 1)-Matrix over Zp. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Hanna Mazzawi |
Optimal Query Complexity for Reconstructing Hypergraphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Hanna Mazzawi |
Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Hanna Mazzawi |
Optimal Query Complexity for Reconstructing Hypergraphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Philip M. Long |
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering. |
ICML |
2010 |
DBLP BibTeX RDF |
|
| 1 | Hanna Mazzawi, Nader H. Bshouty |
On Parity Check (0, 1)-Matrix over Zp. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Yi Li, Philip M. Long |
Using the doubling dimension to analyze the generalization of learning algorithms. |
J. Comput. Syst. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Hanna Mazzawi |
Reconstructing Weighted Graphs with Minimal Query Complexity. |
ALT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty |
Optimal Algorithms for the Coin Weighing Problem with a Spring Scale. |
COLT |
2009 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Philip M. Long |
Linear Classifiers are Nearly Optimal When Hidden Variables Have Diverse Effect. |
COLT |
2009 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Claudio Gentile |
Guest Editors' Introduction: Special issue on Learning Theory (COLT-2007). |
Machine Learning |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurence Bisht, Nader H. Bshouty, Lawrance Khoury |
Learning with errors in answers to membership queries. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio |
Learning Automata. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rotem Bennet, Nader H. Bshouty |
Learning attribute-efficiently with corrupt oracles. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Claudio Gentile (eds.) |
Learning Theory, 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007, Proceedings |
COLT |
2007 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Lynn Burroughs |
Maximizing agreements and coagnostic learning. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Michael Kaminski |
Polynomial multiplication over finite fields: from quadratic to straight-line complexity. |
Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
Subject classification. 12Y05, 68Q25, 68W40, 68W30 |
| 1 | Nader H. Bshouty, Ehab Wattad |
On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle. |
ALT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Iddo Bentov |
On Exact Learning from Random Walk. |
ALT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurence Bisht, Nader H. Bshouty, Hanna Mazzawi |
On Optimal Learning Algorithms for Multiplicity Automata. |
COLT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Hanna Mazzawi |
Exact Learning Composed Classes with a Small Number of Mistakes. |
COLT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Lynn Burroughs |
Maximizing Agreements with One-Sided Error with Applications to Heuristic Learning. |
Machine Learning |
2005 |
DBLP DOI BibTeX RDF |
maximizing agreements, heuristic learning, approximation, Boolean formulas, example-based learning, agnostic learning |
| 1 | Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio |
Learning DNF from random walks. |
J. Comput. Syst. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon |
Exploring learnability between exact and PAC. |
J. Comput. Syst. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rotem Bennet, Nader H. Bshouty |
Learning Attribute-Efficiently with Corrupt Oracles. |
ALT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon |
More efficient PAC-learning of DNF with membership queries under the uniform distribution. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty |
Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability. |
COLT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurence Bisht, Nader H. Bshouty, Lawrance Khoury |
Learning with Errors in Answers to Membership Queries. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty |
The monotone theory for the PAC-model. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon |
Uniform-distribution attribute noise learnability. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Lynn Burroughs |
On the Proper Learning of Axis-Parallel Concepts. |
Journal of Machine Learning Research |
2003 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio |
Learning DNF from Random Walks. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Lynn Burroughs |
On the proper learning of axis parallel concepts |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz |
PAC learning with nasty noise. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Nadav Eiron |
Learning Monotone DNF from a Teacher that Almost Does Not Answer Membership Queries. |
Journal of Machine Learning Research |
2002 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Dmitry Gavinsky |
On Boosting with Polynomially Bounded Distributions. |
Journal of Machine Learning Research |
2002 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Vitaly Feldman |
On Using Extended Statistical Queries to Avoid Membership Queries. |
Journal of Machine Learning Research |
2002 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Yishay Mansour |
Simple Learning Algorithms for Decision Trees and Multivariate Polynomials. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Lynn Burroughs |
Maximizing Agreements and CoAgnostic Learning. |
ALT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Lynn Burroughs |
Bounds for the Minimum Disagreement Problem with Applications to Learning Theory. |
COLT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon |
Exploring Learnability between Exact and PAC. |
COLT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Lynn Burroughs |
On the Proper Learning of Axis Parallel Concepts. |
COLT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Dmitry Gavinsky |
PAC = PAExact and Other Equivalent Models in Learning. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Nadav Eiron |
Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries. |
COLT/EuroCOLT |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Avi Owshanko |
Learning Regular Sets with an Incomplete Membership Oracle. |
COLT/EuroCOLT |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Dmitry Gavinsky |
On Boosting with Optimal Poly-Bounded Distributions. |
COLT/EuroCOLT |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Vitaly Feldman |
On Using Extended Statistical Queries to Avoid Membership Queries. |
COLT/EuroCOLT |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio |
Learning functions represented as multiplicity automata. |
J. ACM |
2000 |
DBLP DOI BibTeX RDF |
learning disjoint, learning polynomials, multiplicity automata, DNF, computational learning |
| 1 | Nader H. Bshouty, Lisa Higham, Jolanta Warpechowska-Gruca |
Meeting Times of Random Walks on Graphs. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty |
Lower Bounds for the Complexity of Functions in a Realistic RAM Model. |
J. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Jeffrey C. Jackson |
Learning DNF over the Uniform Distribution Using a Quantum Example Oracle. |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz |
PAC Learning with Nasty Noise. |
ATL |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, David K. Wilson |
On Learning in the Presence of Unspecified Attribute Values. |
COLT |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon |
More Efficient PAC-Learning of DNF with Membership Queries Under the Uniform Distribution. |
COLT |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Elias Abboud, Nader Agha, Nader H. Bshouty, Nizar Radwan, Fathi Saleh |
Learning Threshold Functions with Small Weights Using Membership Queries. |
COLT |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon |
Uniform-Distribution Attribute Noise Learnability. |
COLT |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Christino Tamon, David K. Wilson |
On Learning width Two Branching Programs. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty |
A New Composition Theorem for Learning Algorithms |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon |
Attribute Efficient PAC Learning of DNF with Membership Queries under the Uniform Distribution |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty |
On the Direct Sum Conjecture in the Straight Line Model. |
J. Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Christino Tamon, David K. Wilson |
On Learning Decision Trees with Large Output Domains. |
Algorithmica |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Christino Tamon, David K. Wilson |
Learning Matrix Functions over Rings. |
Algorithmica |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Sally A. Goldman, H. David Mathias |
Noise-Tolerant Parallel Learning of Geometric Concepts. |
Inf. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki |
Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. |
J. ACM |
1998 |
DBLP DOI BibTeX RDF |
geometric concepts, computational learning |
| 1 | Daoud Bshouty, Nader H. Bshouty |
On Interpolating Arithmetic Read-Once Formulas with Exponentiation. |
J. Comput. Syst. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Lisa Hellerstein |
Attribute-Efficient Learning in Query and Mistake-Bound Models. |
J. Comput. Syst. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Richard Cleve |
Interpolating Arithmetic Read-Once Formulas in Parallel. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias |
Exact Learning of Discretized Geometric Concepts. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Lynn Burroughs |
Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem. |
STACS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty |
A New Composition Theorem for Learning Algorithms. |
STOC |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari |
A Tight Bound for Approximating the Square Root. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty |
On Learning Multivariate Polynomials Under the Uniform Distribution. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty |
Exact Learning of Formulas in Parallel. |
Machine Learning |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty |
Simple Learning Algorithms Using Divide and Conquer. |
Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio |
On Learning Programs and Small Depth Circuits. |
EuroCOLT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Christino Tamon, David K. Wilson |
Learning Matrix Functions over Rings. |
EuroCOLT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz |
A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes. |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty |
A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries. |
Inf. Process. Lett. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Francesco Bergadano, Nader H. Bshouty, Stefano Varricchio |
Learning Multivariate Polynomials from Substitution and Equivalence Queries |
Electronic Colloquium on Computational Complexity (ECCC) |
1996 |
DBLP BibTeX RDF |
|
| 1 | Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio |
On Learning Branching Programs and Small Depth Circuits |
Electronic Colloquium on Computational Complexity (ECCC) |
1996 |
DBLP BibTeX RDF |
|
| 1 | Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz |
A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes |
Electronic Colloquium on Computational Complexity (ECCC) |
1996 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Christino Tamon |
On the Fourier Spectrum of Monotone Functions. |
J. ACM |
1996 |
DBLP DOI BibTeX RDF |
harmonic analysis learning, monotone Boolean, complexity, approximation, Fourier transform, functions, circuits, monotone circuits |
| 1 | Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon |
Oracles and Queries That Are Sufficient for Exact Learning. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, Sleiman Matar |
Asking Questions to Minimize Errors. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Lisa Hellerstein |
Attribute-Efficient Learning in Query and Mistake-Bound Models. |
COLT |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Christino Tamon, David K. Wilson |
On Learning width Two Branching Programs (Extended Abstract). |
COLT |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio |
On the Applications of Multiplicity Automata in Learning. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
multiplicity automata, DNF formulae learnability, minimal multiplicity automaton, multiplicity automata learning, finite field polynomials, infinite field bounded-degree polynomials, decision trees, states, matrix, automata theory, automata theory, query complexity |
| 1 | Nader H. Bshouty |
Towards the Learnability of DNF Formulae. |
STOC |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki |
Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. |
STOC |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty |
On the Additive Complexity of 2 x 2 Matrix Multiplication. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty |
A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Christino Tamon |
On the Fourier spectrum of Monotone Functions |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty |
Exact Learning Boolean Functions via the Monotone Theory |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon |
Oracles and Queries That Are Sufficient for Exact Learning |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty |
The Monotone Theory for the PAC-Model |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")