Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Bshouty, Nader H."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Toward a deterministic polynomial time algorithm with optimal additive query complexity
Nader H. Bshouty
,
Hanna Mazzawi
Theoretical Computer Science
417
, 2012, pp. 23-35
Reconstructing weighted graphs with minimal query complexity
Nader H. Bshouty
,
Hanna Mazzawi
Theoretical Computer Science
412
(19), 2011, pp. 1782-1790
Toward a deterministic polynomial time algorithm with optimal additive query complexity
Nader H. Bshouty
,
Hanna Mazzawi
Lecture Notes in Computer Science
6281
, 2010, pp. 221-232
Optimal query complexity for reconstructing hypergraphs
Nader H. Bshouty
,
Hanna Mazzawi
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 143-154
Using the doubling dimension to analyze the generalization of learning algorithms
Nader H. Bshouty
,
Yi Li
,
Philip M. Long
Journal of Computer and System Sciences
75
(6), 2009, pp. 323-335
Learning with errors in answers to membership queries
Laurence Bisht
,
Nader H. Bshouty
,
Lawrance Khoury
Journal of Computer and System Sciences
74
(1), 2008, pp. 2-15
Learning attribute-efficiently with corrupt oracles
Rotem Bennet
,
Nader H. Bshouty
Theoretical Computer Science
387
(1), 2007, pp. 32-50
Maximizing agreements and coagnostic learning
Nader H. Bshouty
,
Lynn Burroughs
Theoretical Computer Science
350
(1), 2006, pp. 24-39
Exploring learnability between exact and PAC
Nader H. Bshouty
,
Jeffrey C. Jackson
,
Christino Tamon
Journal of Computer and System Sciences
70
(4), 2005, pp. 471-484
Learning DNF from random walks
Nader H. Bshouty
,
Elchanan Mossel
,
Ryan O'Donnell
,
Rocco A. Servedio
Journal of Computer and System Sciences
71
(3), 2005, pp. 250-265
More efficient PAC-learning of DNF with membership queries under the uniform distribution
Nader H. Bshouty
,
Jeffrey C. Jackson
,
Christino Tamon
Journal of Computer and System Sciences
68
(1), 2004, pp. 205-234
Uniform-distribution attribute noise learnability
Nader H. Bshouty
,
Jeffrey C. Jackson
,
Christino Tamon
Information and Computation
187
(2), 2003, pp. 277-290
The monotone theory for the PAC-model
Nader H. Bshouty
Information and Computation
186
(1), 2003, pp. 20-35
PAC learning with nasty noise
Nader H. Bshouty
,
Nadav Eiron
,
Eyal Kushilevitz
Theoretical Computer Science
288
(2), 2002, pp. 255-275
Pac = PAExact and other equivalent models in learning
Nader H. Bshouty
,
Dmitry Gavinsky
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 167-176
Simple learning algorithms for decision trees and multivariate polynomials
Nader H. Bshouty
,
Yishay Mansour
SIAM Journal on Computing
31
(6), 2002, pp. 1909-1925
Learning functions represented as multiplicity automata
Amos Beimel
,
Francesco Bergadano
,
Nader H. Bshouty
,
Eyal Kushilevitz
,
Stefano Varricchio
Journal of the ACM
47
(3), 2000, pp. 506-530
Meeting times of random walks on graphs
Nader H. Bshouty
,
Lisa Higham
,
Jolanta Warpechowska-Gruca
Information Processing Letters
69
(5), 1999, pp. 259-265
Lower bounds for the complexity of functions in a realistic RAM model
Nader H. Bshouty
Journal of Algorithms
32
(1), 1999, pp. 1-20
On interpolating arithmetic read-once formulas with exponentiation
Daoud Bshouty
,
Nader H. Bshouty
Journal of Computer and System Sciences
56
(1), 1998, pp. 112-124
Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem
Nader H. Bshouty
,
Lynn Burroughs
Lecture Notes in Computer Science
1373
, 1998, pp. 298-308
Interpolating arithmetic read-once formulas in parallel
Nader H. Bshouty
,
Richard Cleve
SIAM Journal on Computing
27
(2), 1998, pp. 401-413
Exact learning of discretized geometric concepts
Nader H. Bshouty
,
Paul W. Goldberg
,
Sally A. Goldman
,
H. David Mathias
SIAM Journal on Computing
28
(2), 1998, pp. 674-699
Noise-tolerant distribution-free learning of general geometric concepts
Nader H. Bshouty
,
Sally A. Goldman
,
H. David Mathias
,
Subhash Suri
,
Hisao Tamaki
Journal of the ACM
45
(5), 1998, pp. 863-890
Noise-tolerant parallel learning of geometric concepts
Nader H. Bshouty
,
Sally A. Goldman
,
H. David Mathias
Information and Computation
147
(1), 1998, pp. 89-110
Seiten 1
2
3
>