Shai Ben-David - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Discerning Linkage-Based Algorithms among Hierarchical Clustering MethodsMargareta Ackerman, Shai Ben-David. IJCAI 2011: 1140-1145 [doi]

2010

2009

Clusterability: A Theoretical StudyMargareta Ackerman, Shai Ben-David. jmlr, 5:1-8, 2009. [doi]

Agnostic Online LearningShai Ben-David, Dávid Pál, Shai Shalev-Shwartz. colt 2009: [doi]

Learning Low Density SeparatorsShai Ben-David, Tyler Lu, Dávid Pál, Miroslava Sotáková. jmlr, 5:25-32, 2009. [doi]

Theory-Practice Interplay in Machine Learning - Emerging Theoretical ChallengesShai Ben-David. pkdd 2009: 1 [doi]

Modeling and Querying Possible Repairs in Duplicate DetectionGeorge Beskales, Mohamed A. Soliman, Ihab F. Ilyas, Shai Ben-David. pvldb, 2(1):598-609, 2009. [doi]

RTTS: towards enterprise-level real-time speech transcription and translation servicesJuan M. Huerta, Cheng Wu, Andrej Sakrajda, Sasha Caskey, Ea-Ee Jan, Alexander Faisman, Shai Ben-David, Wen Liu, Antonio Lee, Osamuyimen Stewart, Michael Frissora, David Lubensky. interspeech 2009: 436-439 [doi]

2008

2007

Stability of ::::k:::: -Means ClusteringShai Ben-David, Dávid Pál, Hans-Ulrich Simon. colt 2007: 20-34 [doi]

ForewordShai Ben-David, John Case, Thomas Zeugmann. TCS, 382(3):167-169, 2007. [doi]

A framework for statistical clustering with constant time approximation algorithms for ::::K::::-median and ::::K::::-means clusteringShai Ben-David. ml, 66(2-3):243-257, 2007. [doi]

2006

2004

Algorithmic Learning Theory, 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004, ProceedingsShai Ben-David, John Case, Akira Maruoka, editors, Volume 3244 of Lecture Notes in Computer Science, Springer, 2004.

A Framework for Statistical Clustering with a Constant Time Approximation Algorithms for K-Median ClusteringShai Ben-David. colt 2004: 415-426 [doi]

Detecting Change in Data StreamsDaniel Kifer, Shai Ben-David, Johannes Gehrke. VLDB 2004: 180-191 [doi]

2003

On the difficulty of approximately maximizing agreementsShai Ben-David, Nadav Eiron, Philip M. Long. jcss, 66(3):496-514, 2003. [doi]

Exploiting Task Relatedness for Mulitple Task LearningShai Ben-David, Reba Schuller. colt 2003: 567-580 [doi]

2002

2001

Limitations of Learning via Embeddings in Euclidean Half-SpacesShai Ben-David, Nadav Eiron, Hans-Ulrich Simon. colt 2001: 385-401 [doi]

Agnostic BoostingShai Ben-David, Philip M. Long, Yishay Mansour. colt 2001: 507-516 [doi]

2000

Learning Changing Concepts by Exploiting the Structure of ChangePeter L. Bartlett, Shai Ben-David, Sanjeev R. Kulkarni. ml, 41(2):153-174, 2000.

The Computational Complexity of Densest Region DetectionShai Ben-David, Nadav Eiron, Hans-Ulrich Simon. colt 2000: 255-265

On the Difficulty of Approximately Maximizing AgreementsShai Ben-David, Nadav Eiron, Philip M. Long. colt 2000: 266-274

A Note On Vc-Dimension And Measure Of Sets Of RealsShai Ben-David, Leonid Gurvits. cpc, 9(5), 2000.

Efficient Learning of Linear PerceptronsShai Ben-David, Hans-Ulrich Simon. nips 2001: 189-195

A modal logic for subjective default reasoningShai Ben-David, Rachel Ben-Eliyahu-Zohary. ai, 116(1-2):217-236, 2000. [doi]

A Note on Non-complete Problems in NPImageShai Ben-David, Klaus Meer, Christian Michaux. jc, 16(1):324-332, 2000. [doi]

Localized BoostingRon Meir, Ran El-Yaniv, Shai Ben-David. colt 2000: 190-199

1999

Hardness Results for Neural Network Approximation ProblemsPeter L. Bartlett, Shai Ben-David. eurocolt 1999: 50-62 [doi]

VC-Dimension Analysis of Object Recognition TasksMichael Lindenbaum, Shai Ben-David. jmiv, 10(1):27-49, 1999. [doi]

1998

1997

Scale-sensitive dimensions, uniform convergence, and learnabilityNoga Alon, Shai Ben-David, Nicolò Cesa-Bianchi, David Haussler. JACM, 44(4):615-631, 1997. [doi]

Learning Distributions by Their Density Levels: A Paradigm for Learning without a TeacherShai Ben-David, Michael Lindenbaum. jcss, 55(1):171-182, 1997.

Computational Learning Theory, Third European Conference, EuroCOLT 97, Jerusalem, Israel, March 17-19, 1997, ProceedingsShai Ben-David, editor, Volume 1208 of Lecture Notes in Computer Science, Springer, 1997.

Online Learning versus Offline LearningShai Ben-David, Eyal Kushilevitz, Yishay Mansour. ml, 29(1):45-63, 1997.

A Composition Theorem for Learning Algorithms with Applications to Geometric Concept ClassesShai Ben-David, Nader H. Bshouty, Eyal Kushilevitz. stoc 1997: 324-333 [doi]

1996

Learning Changing Concepts by Exploiting the Structure of ChangePeter L. Bartlett, Shai Ben-David, Sanjeev R. Kulkarni. colt 1996: 131-139 [doi]

A Composition Theorem for Learning Algorithms with Applications to Geometric Concept ClassesShai Ben-David, Nader H. Bshouty, Eyal Kushilevitz. eccc, 3(59), 1996. [doi]

1995

Characterizations of Learnability for Classes of {0, ..., n}-Valued FunctionsShai Ben-David, Nicolò Cesa-Bianchi, David Haussler, Philip M. Long. jcss, 50(1):74-86, 1995.

Learning by DistancesShai Ben-David, Alon Itai, Eyal Kushilevitz. iandc, 117(2):240-250, March 1995.

On Self-Directed LearningShai Ben-David, Nadav Eiron, Eyal Kushilevitz. colt 1995: 136-143 [doi]

A Note on VC-Dimension and Measures of Sets of RealsShai Ben-David, Leonid Gurvits. colt 1995: 454-462 [doi]

A Parametrization Scheme for Classifying Models of PAC LearnabilityShai Ben-David, Gyora M. Benedek, Yishay Mansour. iandc, 120(1):11-21, July 1995.

Online learning versus offline learningShai Ben-David, Eyal Kushilevitz, Yishay Mansour. eurocolt 1995: 38-52

Learning distributions by their density-levels - a paradigm for learning without a teacherShai Ben-David, Michael Lindenbaum. eurocolt 1995: 53-68

1994

On Ultrafilters and NPShai Ben-David, Mauricio Karchmer, Eyal Kushilevitz. cocoon 1994: 97-105

On the Power of Randomization in On-Line AlgorithmsShai Ben-David, Allan Borodin, Richard M. Karp, Gábor Tardos, Avi Wigderson. algorithmica, 11(1):2-14, 1994.

A New Measure for the Study of On-Line AlgorithmsShai Ben-David, Allan Borodin. algorithmica, 11(1):73-91, 1994.

Learnability with Restricted Focus of Attention guarantees Noise-ToleranceShai Ben-David, Eli Dichterman. alt 1994: 248-259

a modal logic for subjective default reasoningShai Ben-David, Rachel Ben-Eliyahu. lics 1994: 477-486

Applying VC-Dimension Analysis To 3D Object Recognition from Perspective ProjectionsMichael Lindenbaum, Shai Ben-David. AAAI 1994: 985-990

Applying VC-dimension Analysis To Object RecognitionMichael Lindenbaum, Shai Ben-David. eccv 1994: 239-250

1993

1992

On the Theory of Average Case ComplexityShai Ben-David, Benny Chor, Oded Goldreich, Michael Luby. jcss, 44(2):193-219, 1992.

Characterizations of Learnability for Classes of {::::O, ..., n::::}-Valued FunctionsShai Ben-David, Nicolò Cesa-Bianchi, Philip M. Long. colt 1992: 333-340 [doi]

Can Finite Samples Detect Singularities of Real-Valued Functions?Shai Ben-David. stoc 1992: 390-399

1991

On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract)Uri Abraham, Shai Ben-David, Shlomo Moran. wdag 1992: 1-8

1990

On the Power of Randomization in Online Algorithms (Extended Abstract)Shai Ben-David, Allan Borodin, Richard M. Karp, Gábor Tardos, Avi Wigderson. stoc 1990: 379-386

Learning by DistancesShai Ben-David, Alon Itai, Eyal Kushilevitz. colt 1990: 232-245 [doi]

1989

On the Theory of Average Case Complexity (abstract)Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby. cocoon 1989: 36

On the Theory of Average Case ComplexityShai Ben-David, Benny Chor, Oded Goldreich, Michael Luby. stoc 1989: 204-216

A Parametrization Scheme for Classifying Models of LearnabilityShai Ben-David, Gyora M. Benedek, Yishay Mansour. colt 1989: 285-302 [doi]

1988

The Global Time Assumption and Semantics for Concurrent SystemsShai Ben-David. podc 1988: 223-231 [doi]

1986

The Weak is Really Weaker than the FullShai Ben-David, Menachem Magidor. JSYML, 51(4):1029-1033, 1986.