(extended abstract) Michael Kearns ATT Bell Laboratories Yishay Mansour...  Home/Search
Context
Related
| upenn.edu/~mkearns/papers/dist.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: upenn.edu/~mkearns/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we concentrate on discrete (Update)
Similar documents based on text: More All
0.3: On the Learnability of Discrete Distributions (Extended.. - Kearns, Mansour, Ron (1994) (Correct)
0.1: [Tou89] David Touretsky. - Advances In Neural (Correct)
0.1: Learning Functions Represented as Multiplicity Automata - Beimel, Bergadano.. (1997) (Correct)
BibTeX entry: (Update)
@misc{ michael-proceedings,
author = "Extended Michael",
title = "Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages
273--282, 1994. On the Learnability of Discrete Distributions",
url = "citeseer.ist.psu.edu/681533.html" }
Citations (may not include all citations):2319 Elements of Information Theory (context) - Cover, Thomas - 1991
2133 Pattern Classification and Scene Analysis (context) - Duda, Hart - 1973
493 Communications of the ACM (context) - Valiant, of et al. - 1984
465 Learnability and the VapnikChervonenkis dimension (context) - Blumer, Ehrenfeucht et al. - 1989
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
348 Estimation of Dependences Based on Empirical Data (context) - Vapnik - 1982
273 The strength of weak learnability - Schapire - 1990
268 Decision theoretic generalizations of the PAC model for neur.. (context) - Haussler - 1992
184 Cryptographic limitations on learning Boolean formulae and f.. - Kearns, Valiant - 1989
163 The complexity of enumeration and reliability problems (context) - Valiant - 1979
149 Information Processing Letters (context) - Blumer, Ehrenfeucht et al. - 1987
139 A greedy heuristic for the set covering problem (context) - Chvatal - 1979
115 Efficient distribution-free learning of probabilistic concep.. - Kearns, Schapire - 1990
107 Efficient noise-tolerant learning from statistical queries - Kearns - 1993
103 A simple unpredictable pseudo-random number generator (context) - Blum, Blum et al. - 1986
[Article contains additional citations not shown here]
Documents on the same site (http://www.cis.upenn.edu/~mkearns/): More
Graphical Economics - Sham Kakade Michael (Correct)
Efficient Algorithms for Learning to Play Repeated Games Against.. - al. (1995) (Correct)
On the Boosting Ability of Top-Down Decision Tree Learning.. - Kearns (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC