Bernard Ycart and Joel Ratsaby LMC, CNRS UMR 5523, BP 53, 38041 Grenoble...  Home/Search
Context
Related
| bgu.ac.il/~ratsaby/Publicati...VCRC.pdf 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: bgu.ac.il/~ratsaby...Publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper is to investigate the size of sets that are shattered by a random class F of functions (a random element of the power set )) (Update)
Active bibliography (related documents): More All
0.5: Complexity of VC-classes of sequences with long repetitive - Runs Joel Ratsaby (Correct)
0.3: Clustering for Edge-Cost Minimization - Schulman (Correct)
0.3: Mathematical Snapshots From the Computational Geometry Landscape - Matousek (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ and-discrete,
author = "Bernard Ycart And",
title = "Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.),
by the authors, 1--1 VC-dimensions of random function classes",
url = "citeseer.ist.psu.edu/739985.html" }
Citations (may not include all citations):1749 An introduction to probability theory and its applications (context) - Feller - 1968
947 Statistical Learning Theory (context) - Vapnik - 1998
454 the uniform convergence of relative frequencies of events to.. (context) - Vapnik, Chervonenkis - 1971
318 Convergence of Stochastic Processes (context) - Pollard - 1984
268 Decision theoretic generalizations of the PAC model for neur.. (context) - Haussler - 1992
131 Combinatorial Geometry (context) - Pach, Agarwal - 1995
115 the density of families of sets (context) - Sauer - 1972
91 Random Graphs - Janson, uczak et al. - 2000
91 Epsilon-nets and simplex range queries (context) - Haussler, Welzl - 1987
88 Neural Network Learning: Theoretical Foundations (context) - Anthony, Bartlett - 1999
71 Scale-sensitive dimensions (context) - Alon, Ben-David et al. - 1997
55 Cambridge University Press (context) - Bollobas - 2001
50 Poisson approximation (context) - Barbour, Holst et al. - 1992
21 A generalization of Sauer's lemma (context) - Haussler, Long - 1995
15 the trace of finite sets (context) - Frankl - 1983
14 On exact specification by examples (context) - Anthony, Brightwell et al. - 1992
12 stability and order for models and theories in infinitary la.. (context) - Shelah, problem - 1972
9 and combinatorial probability (context) - Bollobas, Set et al. - 1986
6 A correlation inequality and a poisson limit theorem for non.. (context) - Suen - 1990
6 New versions of Suen's correlation inequality - Janson - 1998
6 The Vapnik-Chervonenkis dimension of a random graph - Anthony, Brightwell et al. - 1995
3 Geometric set systems - Matousek - 1998
1 Color critical hypergraphs and forbidden configurations (context) - Anstee, Fleming et al. - 2005
1 Nine lectures on Random Graphs (context) - Spencer - 1991
1 uniform random hypergraphs (context) - Ycart, Ratsaby et al. - 2005
Documents on the same site (http://www.bgu.ac.il/~ratsaby/Publications.htm): More
Complexity of Hyperconcepts Joel Ratsaby - Ben Gurion University (2005) (Correct)
Complexity of VC-classes of sequences with long repetitive - Runs Joel Ratsaby (Correct)
On the Complexity of Constrained VC-Classes Joel Ratsaby - Ben Gurion University (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