@book{ambartzumian,
author="R.V. Ambartzumian",
title="Factorization Calculus and Geometric Probability",
publisher="Cambridge University Press",
address="Cambridge",
year=1990}

@book{ash,
author="R.B. Ash",
title="Real Analysis and Probability",
publisher="Academic Press",
address="New York",
year=1972}

@article{ba-bo-lu,
author="P.L. Bartlett and S. Boucheron and G. Lugosi",
title="Model selection and error estimation",
journal="preprint",
year=2000,
note="(A shorter version of this paper was apparently presented at COLT 2000.)"}

@article{Bo-lu-ma,
author="S. Boucheron and G. Lugosi and P. Massart",
title="A sharp inequality with applications",
journal="Random Structures and Algorithms",
volume=16,
pages="277-292",
year=2000}

@article{bu-ku,
author="K. Buescher and P. Kumar",
title="Learning by canonical smooth estimation, Part II: Learning and choice of model complexity",
journal="IEEE Transactions on Automatic Control",
volume=41,
pages="557-569",
year=1996}

@inproceedings{ca-co,
author="A.H. Cannon and L.J. Cowen",
title="Approximation algorithms for the class cover problem",
booktitle="Proceedings of the 6th International Symposium on Mathematics and Artificial Intelligence",
year=2000}

@article{Cortes95,
author="C. Cortes and V. Vapnik",
title="Support-Vector Networks",
journal="Machine Learning",
volume=20,
pages="273-297",
year=1995}

@article{cover,
author="T. Cover",
title="Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition",
journal="IEEE Transactions on Electronic Computers",
volume=14,
pages="326-334",
year=1965}

@book{Crist00,
author="N. Cristianini and J. Shawe-Taylor",
title="An Introduction to Support Vector Machines and Other Kernel-based Learning Methods",
publisher="Cambridge University Press",
address="Cambridge",
year=2000}

@book{de-gy-lu,
author="L. Devroye and L. Gy{\"{o}}rfi and G. Lugosi",
title="A Probabilistic Theory of Pattern Recognition",
publisher="Springer-Verlag",
year=1996}

@article{devroye,
author="L. Devroye",
title="Automatic Pattern Recognition: A study of the probability of error",
journal="IEEE Transactions on Pattern Recognition and Machine Intelligence",
volume=10,
number=4,
pages="530-543",
year=1988}

@book{dudley,
author="R.M. Dudley",
title="Uniform Central Limit Theorems",
publisher="Cambridge University Press",
address="New York",
year=1999}

@inproceedings{freund,
author="Y. Freund",
title="Self bounding learning algorithms",
booktitle="COLT; Proceedings of the Workshop on Computational Learning Theory",
publisher="Morgan Kaufmann",
year=1998}

@techreport{gat,
author="Y. Gat",
title="A bound concerning the generalization ability of a certain class of learning algorithms",
institution="University of California, Berkeley",
number=548,
year=1999}

@book{Hoc97a,
author="Dorit S. Hochbaum",
title="Approximation Algorithms for NP-Hard Problems",
publisher="PWS Publishing Company",
year=1997}

@article{hu-sc,
author="D. Hush and C. Scovel",
title="On the VC dimension of bounded margin classifiers",
journal="Machine Learning",
volume=45,
pages="33-44",
year=2001}

@article{Joh78a,
author="D.S. Johnson and F.P. Preparata",
title="The densest hemisphere problem",
journal="Theoretical Computer Science",
volume=6,
pages="93-107",
year=1978}

@article{koltchinskii,
author="V.I. Koltchinskii",
title="Rademacher penalties and structural risk minimization",
journal="IEEE Transactions on Information Theory",
volume=47,
number=5,
pages="1902-1914",
year=2001}

@article{ko-ab-ar-do-pa,
author="V.I. Koltchinskii and C.T. Abdallah and M. Ariola and P. Dorato and D. Panchenko",
title="Improved sample complexity estimates for statistical learning control of uncertain systems",
journal="IEEE Transactions on Automatic Control",
volume=45,
number=12,
pages="2383-2388",
year=2000}

@article{ma-pr,
author="D.J. Marchette and C.E. Priebe",
title="Characterizing the scale dimension of a high dimensional classification problem",
journal="Pattern Recognition",
note="forthcoming"}

@article{pr-de-ma,
author="C.E. Priebe and J.G. DeVinney and D.J. Marchette",
title="On the distribution of the domination number for random class cover catch digraphs",
journal="Statistics and Probability Letters",
volume=55,
number=3,
pages="239-246",
year=2001}

@article{rogers,
author="L.C.G. Rogers",
title="The probability that two samples in the plane have disjoint convex hulls",
journal="Journal of Applied Probability",
volume=15,
pages="790-802",
year=1978}

@article{Sch01,
author="B. Sch{\"o}lkopf",
title="The kernel trick for distances",
journal="Advances in Neural Information Processing Systems",
volume=13,
pages="301-307",
year=2001,
publisher="MIT Press",
address="Cambridge, MA",
note="Editors: T.K. Leen, T.G. Dietterich, and V. Tresp"}

@article{serfling,
author="R.J. Serfling",
title="Probability inequalities for the sum in sampling without replacement",
journal="Annals of Statistics",
volume=2,
number=1,
pages="39-48",
year=1974}

@article{sh-ba-wi-an,
author="J. Shawe-Taylor and P.L. Bartlett and R.C. Williamson and M. Anthony",
title="Structural risk minimization over data-dependent hierarchies",
journal="IEEE Transactions on Information Theory",
volume=44,
number=5,
pages="1926-1940",
year=1998,
note="Also appeared in {\em NeuroCOLT Technical Report}, NC-TR-96-053, 1996."}

@techreport{Sha00a,
author="J. Shawe-Taylor and N. Cristianini",
title="On the generalization of soft margin algorithms",
Institution="NeuroCOLT2 Technical Report Series",
number="NC2-TR-2000-082",
pages="1-32",
year=2000}

@book{shiryaev,
author="A.N. Shiryaev",
title="Probability",
publisher="Springer-Verlag",
address="New York",
year=1980}

@book{Vap98a,
author="V.N. Vapnik",
title="Statistical Learning Theory",
publisher="John Wiley and Sons, Inc.",
address="New York",
year=1998}

@article{You38a,
author="G. Young and A.S. Householder",
title="Discussion of a set of points in terms of their mutual distances",
journal="Psychometrika",
volume=3,
pages="19-22",
year=1938}