메뉴 건너뛰기




Volumn , Issue , 2010, Pages 468-477

Testing properties of sparse images

Author keywords

Images; Property testing; Sublinear algorithms

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EID: 78751550690     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.52     Document Type: Conference Paper
Times cited : (6)

References (25)
  • 1
    • 84855206859 scopus 로고    scopus 로고
    • Information theory in property testing and monotonicity testing in higher dimensions
    • N. Ailon and B. Chazelle. Information theory in property testing and monotonicity testing in higher dimensions. Information and Computation, 204:1704-1717, 2006.
    • (2006) Information and Computation , vol.204 , pp. 1704-1717
    • Ailon, N.1    Chazelle, B.2
  • 3
    • 10644273353 scopus 로고    scopus 로고
    • Fast approximate PCPs for multidimensional bin-packing problems
    • T. Batu, R. Rubinfeld, and P. White. Fast approximate PCPs for multidimensional bin-packing problems. Information and Computation, 196(1):42-56, 2005.
    • (2005) Information and Computation , vol.196 , Issue.1 , pp. 42-56
    • Batu, T.1    Rubinfeld, R.2    White, P.3
  • 6
    • 84943272022 scopus 로고    scopus 로고
    • Property testing with geometric queries
    • A. Czumaj and C. Sohler. Property testing with geometric queries. In Proceedings of the 9th ESA, pages 266-277, 2001.
    • (2001) Proceedings of the 9th ESA , pp. 266-277
    • Czumaj, A.1    Sohler, C.2
  • 10
    • 1342287021 scopus 로고    scopus 로고
    • On the strength of comparisons in property testing
    • E. Fischer. On the strength of comparisons in property testing. Inf. Comput., 189(1):107-116, 2004.
    • (2004) Inf. Comput. , vol.189 , Issue.1 , pp. 107-116
    • Fischer, E.1
  • 13
    • 0032108275 scopus 로고    scopus 로고
    • Property testing and its connection to learning and approximation
    • O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. Journal of the ACM, 45(4):653-750, 1998.
    • (1998) Journal of the ACM , vol.45 , Issue.4 , pp. 653-750
    • Goldreich, O.1    Goldwasser, S.2    Ron, D.3
  • 14
    • 0000171993 scopus 로고    scopus 로고
    • Property testing in bounded degree graphs
    • O. Goldreich and D. Ron. Property testing in bounded degree graphs. Algorithmica, pages 302-343, 2002.
    • (2002) Algorithmica , pp. 302-343
    • Goldreich, O.1    Ron, D.2
  • 17
    • 11144271571 scopus 로고    scopus 로고
    • Tight bounds for testing bipartiteness in general graphs
    • T. Kaufman, M. Krivelevich, and D. Ron. Tight bounds for testing bipartiteness in general graphs. SIAM Journal on Computing, 33(6):1441-1483, 2004.
    • (2004) SIAM Journal on Computing , vol.33 , Issue.6 , pp. 1441-1483
    • Kaufman, T.1    Krivelevich, M.2    Ron, D.3
  • 22
  • 24
    • 0030128622 scopus 로고    scopus 로고
    • Robust characterizations of polynomials with applications to program testing
    • R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996. (Pubitemid 126577271)
    • (1996) SIAM Journal on Computing , vol.25 , Issue.2 , pp. 252-271
    • Rubinfeld, R.1    Sudan, M.2
  • 25
    • 0001024505 scopus 로고
    • On the uniform convergence of relative frequencies of events to their probabilities
    • V. N. Vapnik and A. Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its applications, 17(2):264-280, 1971.
    • (1971) Theory of Probability and Its Applications , vol.17 , Issue.2 , pp. 264-280
    • Vapnik, V.N.1    Chervonenkis, A.Y.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.