skip to main content
10.1145/41958.41994acmconferencesArticle/Chapter ViewAbstractPublication PagessocgConference Proceedingsconference-collections
Article
Free Access

Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension

Authors Info & Claims
Published:01 October 1987Publication History
First page image

References

  1. Al.Alon, N., Expanders, sorting in rounds and superconcentrators of limited depth, in "Proc. 17th ACM Sump. on Theory of Coaput." (1985) 98-102. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A2.Al.on, N., Eigenvalues, geometric expanders, sorting in rounds and Ramsey theory, Combinatorics 6 (1986) 207-219. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. F.Yredman, M. L., Lower bounds on the complexity of some optimal dstostructures, SIAW J. Cornput. 1C (l!Ml) l-10.Google ScholarGoogle Scholar
  4. H.Hall, M.Jr., Combinatorial Theory, Wiley and Sons, New York, London (1967).Google ScholarGoogle Scholar
  5. HW.Haussler, D. and Welzl, Is., Bpsilonriots and simplex range search, Discrete and Conput. Geor., to appear.Google ScholarGoogle Scholar
  6. L.Lovasz, L., Combinatorial Problems and Exercises, North-Holland, Amsterdam, New York, Oxford (1979).Google ScholarGoogle Scholar
  7. S.Sauer, N., On the density of families of sets, J. Combin. Theory Ser. A 13 (1972) 145-147.Google ScholarGoogle ScholarCross RefCross Ref
  8. VC.Vapnik, V.N. and Chervonenkis', A.YA., On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Rpp.1. 16 (1971) 164-280.Google ScholarGoogle Scholar
  9. W.Willard, D., Polygon retrieval, SIAM .I. Cornput. 11 (1982) 149-165.Google ScholarGoogle ScholarCross RefCross Ref
  10. YY.Yaoi A. and Yao, F.) A general approach to d-dfmensional georetric qucrias, in "Proc. 17th ACM Symp. on Theory of Comput." (1985) 163-169. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              SCG '87: Proceedings of the third annual symposium on Computational geometry
              October 1987
              354 pages
              ISBN:0897912314
              DOI:10.1145/41958

              Copyright © 1987 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 October 1987

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              Overall Acceptance Rate625of1,685submissions,37%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader