Approximate testing of visual properties

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2764, Issue , 2003, Pages 370-381

  Raskhodnikova, Sofya ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; OPTIMIZATION;

BINARY PIXELS; HALF-PLANES; PROPERTY-TESTING; QUERY COMPLEXITY; VISUAL PROPERTIES;

APPROXIMATION ALGORITHMS;

EID: 3142758899     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_31     Document Type: Article

References (17)

1. T. Batu, F. Ergun, J. Kilian, A. Magen, S. Raskhodnikova, R. Rubinfeld, and R. Sami, A Sublinear Algorithm for Weakly Approximating Edit Distance, Proceedings of the 35th ACM STOC (2003)
2. E. Ben-Sasson, P. Harsha, and S. Raskhodnikova, 3CNF Properties are Hard to Test, Proceedings of the 35th ACM STOC (2003)
3. A. Blumer, A. Ehrenfeucht, D. Haussler, M. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, Journal of the Association for computing machinery 36(4) (1989) 929-965
4. nd IEEE FOCS (2002)
5. B. Chazelle, R. Rubinfeld, and L. Trevisan, Approximating the minimum spanning tree weight in sublinear time, Proceedings of ICALP (2001)
6. A. Czumaj and C. Sohler, Property testing with geometric queries, Proceedings of the 9th European Symposium on Algorithms (2001) 266-277
7. A. Czumaj, C. Sohler and M. Ziegler, Property testing in computational geometry, Proceedings of the 8th European Symposium on Algorithms (2000) 155-166
8. A. Ehrenfeucht, D. Haussler, M. Kearns and L. Valiant, A General Lower Bound on the Number of Examples Needed for Learning, Information and Computation 82(3) (1989) 247-261
9. E. Fischer, The art of uninformed decisions: A primer to property testing, The Computational Complexity Column of The Bulletin of the European Association for Theoretical Computer Science 75 (2001) 97-126
10. rd ACM STOC (2001) 286-295
11. O. Goldreich, S. Goldwasser and D. Ron, Property testing and its connection to learning and approximation, Journal of the ACM 45 (1998) 653-750
12. O. Goldreich and D. Ron, Property Testing in Bounded Degree Graphs, Proceedings of the 28th ACM STOC (1997)
13. E. Kushilevitz and D. Roth, On Learning Visual Concepts and DNF Formulae, Machine Learning (1996)
14. th IEEE FOCS (1989) 262-267
15. D. Ron, Property testing (a tutorial), In Handbook of Randomized Computing (S. Rajasekaran, P. M. Pardalos, J. H. Reif and J. D. P. Rolimeds), Kluwer Press (2001)
16. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM Journal of Computing 25 (1996) 252-271
17. L. Valiant, A theory of the learnable, Communications of the ACM 27 (1984) 1134-1142