ε-approximations of k-label spaces

Theoretical Computer Science

Volumn 137, Issue 1, 1995, Pages 145-157

  Hasegawa, Susumu ^a   Imai, Hiroshi ^a   Ishiguro, Masaki ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GEOMETRY; IMAGE UNDERSTANDING; RANDOM PROCESSES;

GEOMETRIC CONCEPTS; TWO LABEL SPACE; VORONOI DIAGRAMS;

LEARNING SYSTEMS;

EID: 0029639883     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(94)00165-F     Document Type: Article

References (11)

1. Learnability and Vapnik Chervonenkis dimension
2. A study on ε-net and ε-approximation
3. A generalization of Sauer's Lemma
4. Epsilon-nets and simplex range queries
5. Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering
6. Evaluation of combinatorial complexity for hypothesis spaces in learning theory with applications
7. Discrepancy and ε-approximations for bounded VC-dimension
8. Lecture Notes on Randomized Algorithms
9. Geometric algorithms on an assignment problem
10. On the uniform convergence of relative frequencies of events to their probabilities