In statistical learning theory and computational learning theory, the VC dimension (for Vapnik–Chervonenkis dimension) is a measure of the capacity… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

We explore the relationship between VC-dimension and graph algorithm design. In particular, we show that set systems induced by… (More)

Is this relevant?

2009

2009

- M. Banea, Jason Rigglea, Morgan Sondereggerb
- 2009

We analyze the complexity of Harmonic Grammar (HG), a linguistic model in which licit underlying-to-surfaceform mappings are… (More)

Is this relevant?

2003

2003

- Manfred K. Warmuth
- COLT
- 2003

Note that the VC dimension of orthogonal rectangles is four and this is exactly the number of examples needed to represent the… (More)

Is this relevant?

2001

2001

In this paper, we address the problem of finding the minimal number of viewpoints outside a polyhedron in two or three dimensions… (More)

Is this relevant?

1996

1996

- Thomas Natschläger, Michael Schmitt
- Inf. Process. Lett.
- 1996

We show that the Vapnik-Chervonenkis dimension of Boolean mono-mials over n variables is at most n for all n 2. It follows that… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Michael T. Goodrichy
- 1995

We give a deterministic polynomial time method for nding a set cover in a set system (X; R) of VC-dimension d such that the size… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Pascal Koiran, Eduardo D. Sontag
- NIPS
- 1995

This paper shows that neural networkswhich use continuousactivation functions have VC dimension at least as large as the square… (More)

Is this relevant?

1994

1994

- Wolfgang Maass
- Neural Computation
- 1994

It has been known for quite a while that the Vapnik-Chervonenkis dimension (VC-dimension) of a feedforward neural net with linear… (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- David Haussler, Michael Kearns, Robert E. Schapire
- Machine Learning
- 1991

In this paper we study a Bayesian or average-case model of concept learning with a twofold goal: to provide more precise… (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth
- J. ACM
- 1989

Valiant's learnability model is extended to learning classes of concepts defined by regions in Euclidean space <italic>E<supscrpt… (More)

Is this relevant?