| 2008 |
|---|
| 76 | EE | Shai Ben-David,
Tyler Lu,
Dávid Pál:
Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning.
COLT 2008: 33-44 |
| 75 | EE | Shai Ben-David,
Ulrike von Luxburg:
Relating Clustering Stability to Properties of Cluster Boundaries.
COLT 2008: 379-390 |
| 74 | EE | Shai Ben-David,
Margareta Ackerman:
Measures of Clustering Quality: A Working Set of Axioms for Clustering.
NIPS 2008: 121-128 |
| 73 | EE | Shai Ben-David,
Tyler Lu,
Dávid Pál,
Miroslava Sotáková:
Learning Low-Density Separators
CoRR abs/0805.2891: (2008) |
| 72 | EE | Shai Ben-David,
Reba Schuller Borbely:
A notion of task relatedness yielding provable multiple-task learning guarantees.
Machine Learning 73(3): 273-287 (2008) |
| 2007 |
|---|
| 71 | EE | Shai Ben-David,
Dávid Pál,
Hans-Ulrich Simon:
Stability of k -Means Clustering.
COLT 2007: 20-34 |
| 70 | EE | Shai Ben-David:
A framework for statistical clustering with constant time approximation algorithms for K-median and K-means clustering.
Machine Learning 66(2-3): 243-257 (2007) |
| 69 | EE | Shai Ben-David,
John Case,
Thomas Zeugmann:
Foreword.
Theor. Comput. Sci. 382(3): 167-169 (2007) |
| 2006 |
|---|
| 68 | EE | Nathan Srebro,
Shai Ben-David:
Learning Bounds for Support Vector Machines with Learned Kernels.
COLT 2006: 169-183 |
| 67 | EE | Shai Ben-David,
Ulrike von Luxburg,
Dávid Pál:
A Sober Look at Clustering Stability.
COLT 2006: 5-19 |
| 66 | EE | Shai Ben-David,
John Blitzer,
Koby Crammer,
Fernando Pereira:
Analysis of Representations for Domain Adaptation.
NIPS 2006: 137-144 |
| 65 | EE | Shai Ben-David:
Alternative Measures of Computational Complexity with Applications to Agnostic Learning.
TAMC 2006: 231-235 |
| 64 | EE | Ting He,
Shai Ben-David,
Lang Tong:
Nonparametric change detection and estimation in large-scale sensor networks.
IEEE Transactions on Signal Processing 54(4): 1204-1217 (2006) |
| 63 | EE | Cristian Budianu,
Shai Ben-David,
Lang Tong:
Estimation of the number of operating sensors in large-scale sensor networks with mobile access.
IEEE Transactions on Signal Processing 54(5): 1703-1715 (2006) |
| 2004 |
|---|
| 62 | | Shai Ben-David,
John Case,
Akira Maruoka:
Algorithmic Learning Theory, 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004, Proceedings
Springer 2004 |
| 61 | EE | Shai Ben-David:
A Framework for Statistical Clustering with a Constant Time Approximation Algorithms for K-Median Clustering.
COLT 2004: 415-426 |
| 60 | EE | Daniel Kifer,
Shai Ben-David,
Johannes Gehrke:
Detecting Change in Data Streams.
VLDB 2004: 180-191 |
| 2003 |
|---|
| 59 | EE | Shai Ben-David,
Reba Schuller:
Exploiting Task Relatedness for Mulitple Task Learning.
COLT 2003: 567-580 |
| 58 | EE | Shai Ben-David,
Nadav Eiron,
Philip M. Long:
On the difficulty of approximately maximizing agreements.
J. Comput. Syst. Sci. 66(3): 496-514 (2003) |
| 2002 |
|---|
| 57 | EE | Shai Ben-David,
Johannes Gehrke,
Reba Schuller:
A theoretical framework for learning from a pool of disparate data sources.
KDD 2002: 443-449 |
| 56 | EE | Shai Ben-David,
Nadav Eiron,
Hans-Ulrich Simon:
The Computational Complexity of Densest Region Detection.
J. Comput. Syst. Sci. 64(1): 22-47 (2002) |
| 55 | EE | Shai Ben-David,
Nadav Eiron,
Hans-Ulrich Simon:
Limitations of Learning Via Embeddings in Euclidean Half Spaces.
Journal of Machine Learning Research 3: 441-461 (2002) |
| 54 | EE | Peter L. Bartlett,
Shai Ben-David:
Hardness results for neural network approximation problems.
Theor. Comput. Sci. 284(1): 53-66 (2002) |
| 2001 |
|---|
| 53 | EE | Shai Ben-David,
Nadav Eiron,
Hans-Ulrich Simon:
Limitations of Learning via Embeddings in Euclidean Half-Spaces.
COLT/EuroCOLT 2001: 385-401 |
| 52 | EE | Shai Ben-David,
Philip M. Long,
Yishay Mansour:
Agnostic Boosting.
COLT/EuroCOLT 2001: 507-516 |
| 2000 |
|---|
| 51 | | Ron Meir,
Ran El-Yaniv,
Shai Ben-David:
Localized Boosting.
COLT 2000: 190-199 |
| 50 | | Shai Ben-David,
Nadav Eiron,
Hans-Ulrich Simon:
The Computational Complexity of Densest Region Detection.
COLT 2000: 255-265 |
| 49 | | Shai Ben-David,
Nadav Eiron,
Philip M. Long:
On the Difficulty of Approximately Maximizing Agreements.
COLT 2000: 266-274 |
| 48 | | Shai Ben-David,
Hans-Ulrich Simon:
Efficient Learning of Linear Perceptrons.
NIPS 2000: 189-195 |
| 47 | EE | Shai Ben-David,
Rachel Ben-Eliyahu-Zohary:
A modal logic for subjective default reasoning.
Artif. Intell. 116(1-2): 217-236 (2000) |
| 46 | | Shai Ben-David,
Leonid Gurvits:
A Note On Vc-Dimension And Measure Of Sets Of Reals.
Combinatorics, Probability & Computing 9(5): (2000) |
| 45 | EE | Shai Ben-David,
Klaus Meer,
Christian Michaux:
A Note on Non-complete Problems in NPImage.
J. Complexity 16(1): 324-332 (2000) |
| 44 | | Peter L. Bartlett,
Shai Ben-David,
Sanjeev R. Kulkarni:
Learning Changing Concepts by Exploiting the Structure of Change.
Machine Learning 41(2): 153-174 (2000) |
| 1999 |
|---|
| 43 | EE | Peter L. Bartlett,
Shai Ben-David:
Hardness Results for Neural Network Approximation Problems.
EuroCOLT 1999: 50-62 |
| 1998 |
|---|
| 42 | | Shai Ben-David:
Can Finite Samples Detect Singularities of Reao-Valued Functions?
Algorithmica 22(1/2): 3-17 (1998) |
| 41 | EE | Shai Ben-David,
Ami Litman:
Combinatorial Variability of Vapnik-chervonenkis Classes with Applications to Sample Compression Schemes.
Discrete Applied Mathematics 86(1): 3-25 (1998) |
| 40 | EE | Shai Ben-David,
Anna Gringauze:
On the Existence of Propositional Proof Systems and Oracle-relativized Propositional Logic.
Electronic Colloquium on Computational Complexity (ECCC) 5(21): (1998) |
| 39 | | Shai Ben-David,
Eli Dichterman:
Learning with Restricted Focus of Attention.
J. Comput. Syst. Sci. 56(3): 277-298 (1998) |
| 38 | | Shai Ben-David,
Michael Lindenbaum:
Localization vs. Identification of Semi-Algebraic Sets.
Machine Learning 32(3): 207-224 (1998) |
| 37 | | Shai Ben-David,
Nadav Eiron:
Self-Directed Learning and Its Relation to the VC-Dimension and to Teacher-Directed Learning.
Machine Learning 33(1): 87-104 (1998) |
| 1997 |
|---|
| 36 | | Shai Ben-David:
Computational Learning Theory, Third European Conference, EuroCOLT '97, Jerusalem, Israel, March 17-19, 1997, Proceedings
Springer 1997 |
| 35 | EE | Shai Ben-David,
Nader H. Bshouty,
Eyal Kushilevitz:
A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes.
STOC 1997: 324-333 |
| 34 | EE | Noga Alon,
Shai Ben-David,
Nicolò Cesa-Bianchi,
David Haussler:
Scale-sensitive dimensions, uniform convergence, and learnability.
J. ACM 44(4): 615-631 (1997) |
| 33 | | Shai Ben-David,
Michael Lindenbaum:
Learning Distributions by Their Density Levels: A Paradigm for Learning without a Teacher.
J. Comput. Syst. Sci. 55(1): 171-182 (1997) |
| 32 | | Shai Ben-David,
Eyal Kushilevitz,
Yishay Mansour:
Online Learning versus Offline Learning.
Machine Learning 29(1): 45-63 (1997) |
| 1996 |
|---|
| 31 | EE | Peter L. Bartlett,
Shai Ben-David,
Sanjeev R. Kulkarni:
Learning Changing Concepts by Exploiting the Structure of Change.
COLT 1996: 131-139 |
| 30 | EE | 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) 3(59): (1996) |
| 1995 |
|---|
| 29 | EE | Shai Ben-David,
Nadav Eiron,
Eyal Kushilevitz:
On Self-Directed Learning.
COLT 1995: 136-143 |
| 28 | EE | Shai Ben-David,
Leonid Gurvits:
A Note on VC-Dimension and Measures of Sets of Reals.
COLT 1995: 454-462 |
| 27 | | Shai Ben-David,
Eyal Kushilevitz,
Yishay Mansour:
Online learning versus offline learning.
EuroCOLT 1995: 38-52 |
| 26 | | Shai Ben-David,
Michael Lindenbaum:
Learning distributions by their density-levels - a paradigm for learning without a teacher.
EuroCOLT 1995: 53-68 |
| 25 | | Shai Ben-David,
Alon Itai,
Eyal Kushilevitz:
Learning by Distances
Inf. Comput. 117(2): 240-250 (1995) |
| 24 | | Shai Ben-David,
Gyora M. Benedek,
Yishay Mansour:
A Parametrization Scheme for Classifying Models of PAC Learnability
Inf. Comput. 120(1): 11-21 (1995) |
| 23 | | Shai Ben-David,
Nicolò Cesa-Bianchi,
David Haussler,
Philip M. Long:
Characterizations of Learnability for Classes of {0, ..., n}-Valued Functions.
J. Comput. Syst. Sci. 50(1): 74-86 (1995) |
| 1994 |
|---|
| 22 | | Michael Lindenbaum,
Shai Ben-David:
Applying VC-Dimension Analysis To 3D Object Recognition from Perspective Projections.
AAAI 1994: 985-990 |
| 21 | | Shai Ben-David,
Eli Dichterman:
Learnability with Restricted Focus of Attention guarantees Noise-Tolerance.
AII/ALT 1994: 248-259 |
| 20 | | Michael Lindenbaum,
Shai Ben-David:
Applying VC-dimension Analysis To Object Recognition.
ECCV (1) 1994: 239-250 |
| 19 | | Shai Ben-David,
Rachel Ben-Eliyahu:
a modal logic for subjective default reasoning
LICS 1994: 477-486 |
| 18 | | Shai Ben-David,
Mauricio Karchmer,
Eyal Kushilevitz:
On Ultrafilters and NP.
Structure in Complexity Theory Conference 1994: 97-105 |
| 17 | | Shai Ben-David,
Allan Borodin,
Richard M. Karp,
Gábor Tardos,
Avi Wigderson:
On the Power of Randomization in On-Line Algorithms.
Algorithmica 11(1): 2-14 (1994) |
| 16 | | Shai Ben-David,
Allan Borodin:
A New Measure for the Study of On-Line Algorithms.
Algorithmica 11(1): 73-91 (1994) |
| 1993 |
|---|
| 15 | EE | Shai Ben-David,
Michal Jacovi:
On Learning in the Limit and Non-Uniform (epsilon, delta)-Learning.
COLT 1993: 209-217 |
| 14 | EE | Shai Ben-David,
Eli Dichterman:
Learning with Restricted Focus of Attention.
COLT 1993: 287-296 |
| 13 | EE | Shai Ben-David,
Michael Lindenbaum:
Localization vs. Identification of Semi-Algebraic Sets.
COLT 1993: 327-336 |
| 12 | | Noga Alon,
Shai Ben-David,
Nicolò Cesa-Bianchi,
David Haussler:
Scale-sensitive Dimensions, Uniform Convergence, and Learnability
FOCS 1993: 292-301 |
| 1992 |
|---|
| 11 | EE | Shai Ben-David,
Nicolò Cesa-Bianchi,
Philip M. Long:
Characterizations of Learnability for Classes of {O, ..., n}-Valued Functions.
COLT 1992: 333-340 |
| 10 | | Shai Ben-David:
Can Finite Samples Detect Singularities of Real-Valued Functions?
STOC 1992: 390-399 |
| 9 | | Shai Ben-David,
Benny Chor,
Oded Goldreich,
Michael Luby:
On the Theory of Average Case Complexity.
J. Comput. Syst. Sci. 44(2): 193-219 (1992) |
| 1991 |
|---|
| 8 | | Uri Abraham,
Shai Ben-David,
Shlomo Moran:
On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract).
WDAG 1991: 1-8 |
| 1990 |
|---|
| 7 | EE | Shai Ben-David,
Alon Itai,
Eyal Kushilevitz:
Learning by Distances.
COLT 1990: 232-245 |
| 6 | | Shai Ben-David,
Allan Borodin,
Richard M. Karp,
Gábor Tardos,
Avi Wigderson:
On the Power of Randomization in Online Algorithms (Extended Abstract)
STOC 1990: 379-386 |
| 1989 |
|---|
| 5 | EE | Shai Ben-David,
Gyora M. Benedek,
Yishay Mansour:
A Parametrization Scheme for Classifying Models of Learnability.
COLT 1989: 285-302 |
| 4 | | Shai Ben-David,
Benny Chor,
Oded Goldreich,
Michael Luby:
On the Theory of Average Case Complexity
STOC 1989: 204-216 |
| 3 | | Shai Ben-David,
Benny Chor,
Oded Goldreich,
Michael Luby:
On the Theory of Average Case Complexity (abstract).
Structure in Complexity Theory Conference 1989: 36 |
| 1988 |
|---|
| 2 | EE | Shai Ben-David:
The Global Time Assumption and Semantics for Concurrent Systems.
PODC 1988: 223-231 |
| 1986 |
|---|
| 1 | | Shai Ben-David,
Menachem Magidor:
The Weak is Really Weaker than the Full.
J. Symb. Log. 51(4): 1029-1033 (1986) |
