Travelled to:
1 × Canada
1 × Israel
5 × USA
Collaborated with:
∅ P.M.Long C.Tamon S.Ben-David E.Kushilevitz T.R.Hancock L.Hellerstein S.A.Goldman H.D.Mathias S.Suri H.Tamaki
Talks about:
learn (4) algorithm (2) composit (2) theorem (2) geometr (2) formula (2) concept (2) distribut (1) conjectur (1) spectrum (1)
Person: Nader H. Bshouty
DBLP: Bshouty:Nader_H=
Contributed to:
Wrote 8 papers:
- ICML-2010-BshoutyL #clustering #linear #using
- Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering (NHB, PML), pp. 135–142.
- STOC-1998-Bshouty #algorithm #composition #learning #theorem
- A New Composition Theorem for Learning Algorithms (NHB), pp. 583–589.
- STOC-1997-Ben-DavidBK #algorithm #composition #concept #geometry #learning #theorem
- A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes (SBD, NHB, EK), pp. 324–333.
- STOC-1996-Bshouty #towards
- Towards the Learnability of DNF Formulae (NHB), pp. 131–140.
- STOC-1996-BshoutyGMST #concept #geometry #learning
- Noise-Tolerant Distribution-Free Learning of General Geometric Concepts (NHB, SAG, HDM, SS, HT), pp. 151–160.
- STOC-1995-BshoutyT #fourier #on the
- On the Fourier spectrum of monotone functions (NHB, CT), pp. 219–228.
- STOC-1992-BshoutyHH #learning
- Learning Arithmetic Read-Once Formulas (NHB, TRH, LH), pp. 370–381.
- STOC-1989-Bshouty #on the
- On the Extended Direct Sum Conjecture (NHB), pp. 177–185.