Tolerant property testing and distance approximation
In this paper we study a generalization of standard property testing where the algorithms are required to be more tolerant with respect to objects that do not have, but are close to having, the property. Specifically, a tolerant property testing algorithm is required to accept objects that are ϵ 1 -...
Uloženo v:
| Vydáno v: | Journal of computer and system sciences Ročník 72; číslo 6; s. 1012 - 1042 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Inc
01.09.2006
|
| Témata: | |
| ISSN: | 0022-0000, 1090-2724 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | In this paper we study a generalization of standard property testing where the algorithms are required to be more
tolerant with respect to objects that do not have, but are close to having, the property. Specifically, a
tolerant property testing algorithm is required to accept objects that are
ϵ
1
-close to having a given property
P
and reject objects that are
ϵ
2
-far from having
P
, for some parameters
0
⩽
ϵ
1
<
ϵ
2
⩽
1
. Another related natural extension of standard property testing that we study, is
distance approximation. Here the algorithm should output an estimate
ϵ
ˆ
of the distance of the object to
P
, where this estimate is sufficiently close to the true distance of the object to
P
. We first formalize the notions of tolerant property testing and distance approximation and discuss the relationship between the two tasks, as well as their relationship to standard property testing. We then apply these new notions to the study of two problems: tolerant testing of clustering and distance approximation for monotonicity. We present and analyze algorithms whose query complexity is either polylogarithmic or independent of the size of the input. |
|---|---|
| AbstractList | In this paper we study a generalization of standard property testing where the algorithms are required to be more
tolerant with respect to objects that do not have, but are close to having, the property. Specifically, a
tolerant property testing algorithm is required to accept objects that are
ϵ
1
-close to having a given property
P
and reject objects that are
ϵ
2
-far from having
P
, for some parameters
0
⩽
ϵ
1
<
ϵ
2
⩽
1
. Another related natural extension of standard property testing that we study, is
distance approximation. Here the algorithm should output an estimate
ϵ
ˆ
of the distance of the object to
P
, where this estimate is sufficiently close to the true distance of the object to
P
. We first formalize the notions of tolerant property testing and distance approximation and discuss the relationship between the two tasks, as well as their relationship to standard property testing. We then apply these new notions to the study of two problems: tolerant testing of clustering and distance approximation for monotonicity. We present and analyze algorithms whose query complexity is either polylogarithmic or independent of the size of the input. |
| Author | Ron, Dana Parnas, Michal Rubinfeld, Ronitt |
| Author_xml | – sequence: 1 givenname: Michal surname: Parnas fullname: Parnas, Michal email: michalp@mta.ac.il organization: School of Computer Science, The Academic College of Tel Aviv-Yaffo, Tel Aviv, Israel – sequence: 2 givenname: Dana surname: Ron fullname: Ron, Dana email: danar@eng.tau.ac.il organization: Department of EE-Systems, Tel Aviv University, Tel Aviv, Israel – sequence: 3 givenname: Ronitt surname: Rubinfeld fullname: Rubinfeld, Ronitt email: ronitt@csail.mit.edu organization: CSAIL, MIT, Cambridge, MA, USA |
| BookMark | eNp9j8tqwzAQRUVJoUnaH-jKP2B3JNmyDd2U0BcEuknXQo9xkUllI4nS_H2VpqsuMpuBGc7lnhVZ-MkjIbcUKgpU3I3VaGKsGICogFcA7IIsKfRQspbVC7LMF1ZCniuyinEEoLQRfEnq3bTHoHwq5jDNGNKhSBiT8x-F8rawLiblDRZqzv9v96mSm_w1uRzUPuLN316T96fH3eal3L49v24etqXhAKkchFV9K6jqBsobrjlFq80AHdS65qJlqmtyLw1s0Fr0wgLWPetU2zPN2rrja8JOuSZMMQYc5BxyhXCQFOTRW47y6C2P3hK4zGkZ6v5BxqXf2ikotz-P3p9QzFJfDoOMxmHWty6gSdJO7hz-A6HxdbI |
| CitedBy_id | crossref_primary_10_1145_3488250 crossref_primary_10_1002_rsa_21211 crossref_primary_10_1137_110837863 crossref_primary_10_1002_rsa_21031 crossref_primary_10_1145_1595391_1595394 crossref_primary_10_1137_110831349 crossref_primary_10_1145_1798596_1798605 crossref_primary_10_1137_100791075 crossref_primary_10_1145_1497290_1497298 crossref_primary_10_4007_annals_2009_170_371 crossref_primary_10_1007_s00446_011_0132_x crossref_primary_10_1145_3381418 crossref_primary_10_1145_3319907 crossref_primary_10_1145_3531527 crossref_primary_10_1017_S0963548320000048 crossref_primary_10_1137_18M1217978 crossref_primary_10_1137_110840741 crossref_primary_10_1137_16M1075661 crossref_primary_10_1002_rsa_21221 crossref_primary_10_1007_s00453_024_01233_4 crossref_primary_10_1137_070703776 crossref_primary_10_1145_3337789 crossref_primary_10_1137_13092770X crossref_primary_10_1137_130942152 crossref_primary_10_1016_j_tcs_2023_114316 crossref_primary_10_1137_100811945 crossref_primary_10_1145_3039241 crossref_primary_10_1017_S0963548312000363 crossref_primary_10_1137_080728561 crossref_primary_10_1109_TIT_2024_3483995 crossref_primary_10_1145_3428675 crossref_primary_10_1007_s00224_021_10047_8 crossref_primary_10_1137_17M1110353 crossref_primary_10_1002_rsa_21029 crossref_primary_10_1137_24M1630463 |
| Cites_doi | 10.1007/978-3-540-31856-9_36 10.1090/dimacs/043/04 10.1109/SFCS.2005.5 10.1145/1060590.1060612 10.1007/11538462_26 10.1007/978-3-540-27821-4_21 10.1007/s004930070011 10.1145/285055.285060 10.1006/jcss.1999.1692 10.1145/780542.780548 10.1016/j.ic.2003.09.003 10.1007/978-3-540-48413-4_10 10.1016/j.ic.2004.10.001 10.1007/BF00993468 10.1007/3-540-48224-5_16 10.1007/978-3-540-45198-3_26 10.1137/S0097539793255151 10.1109/SFCS.2000.892113 10.1137/S009753970444199X 10.1137/S0895480102410973 10.1145/509973.509977 10.1145/780542.780590 10.1007/978-3-540-27836-8_61 |
| ContentType | Journal Article |
| Copyright | 2006 Elsevier Inc. |
| Copyright_xml | – notice: 2006 Elsevier Inc. |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.jcss.2006.03.002 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1090-2724 |
| EndPage | 1042 |
| ExternalDocumentID | 10_1016_j_jcss_2006_03_002 S0022000006000444 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1OL 1~. 1~5 29K 4.4 457 4G. 5GY 5VS 6I. 6TJ 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN AAYJJ ABBOA ABEFU ABJNI ABMAC ABTAH ABVKL ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADMUD AEBSH AEKER AENEX AETEA AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CAG COF CS3 D-I DM4 DU5 EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG5 LG9 LY7 M41 MO0 MVM N9A NCXOZ O-L O9- OAUVE OHT OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSV SSZ T5K TN5 TWZ UPT WH7 WUQ XJT XOL XPP YQT ZCG ZMT ZU3 ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c300t-f6da9761a8f1353b31edbcf0804b43672a85002b02fbb696d0e4928a792b27483 |
| ISICitedReferencesCount | 115 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000240202500004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0022-0000 |
| IngestDate | Tue Nov 18 22:39:10 EST 2025 Sat Nov 29 04:16:25 EST 2025 Fri Feb 23 02:19:42 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Keywords | Approximation Clustering Sublinear algorithms Property testing |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c300t-f6da9761a8f1353b31edbcf0804b43672a85002b02fbb696d0e4928a792b27483 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.jcss.2006.03.002 |
| PageCount | 31 |
| ParticipantIDs | crossref_primary_10_1016_j_jcss_2006_03_002 crossref_citationtrail_10_1016_j_jcss_2006_03_002 elsevier_sciencedirect_doi_10_1016_j_jcss_2006_03_002 |
| PublicationCentury | 2000 |
| PublicationDate | 2006-09-01 |
| PublicationDateYYYYMMDD | 2006-09-01 |
| PublicationDate_xml | – month: 09 year: 2006 text: 2006-09-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | Journal of computer and system sciences |
| PublicationYear | 2006 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | S. Halevy, E. Kushilevitz, Distribution-free property testing, in: Proceedings of the Seventh International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM, 2003, pp. 302–317 N. Ailon, B. Chazelle, Information theory in property testing and monotonicity testing in higher dimensions, in: Proceedings of the Twenty-Second Annual Symposium on Theoretical Aspects of Computer Science, STACS, 2005, pp. 434–447 T. Batu, F. Ergun, J. Kilian, A. Magen, S. Raskhodnikova, R. Rubinfeld, Rahul Sami, A sublinear algorithm for weakly approximating edit distance, in: Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing, STOC, 2003, pp. 316–324 T. Batu, L. Fortnow, R. Rubinfeld, W. Smith, P. White, Testing that distributions are close, in: Proceedings of the Forty-First Annual Symposium on Foundations of Computer Science, FOCS, 2000, pp. 259–269 Goldreich, Goldwasser, Lehman, Ron, Samorodnitsky (bib019) 2000; 20 V. Guruswami, A. Rudra, Tolerant locally testable codes, in: Proceedings of the Ninth International Workshop on Randomization and Computation, RANDOM, 2005, pp. 306–317 Ergun, Kannan, Kumar, Rubinfeld, Viswanathan (bib013) 2000; 60 Blum, Luby, Rubinfeld (bib008) 1993; 47 Parnas, Ron, Rubinfeld (bib025) 2004 Fischer (bib014) 2001; 75 Ron (bib026) 2001 Kearns, Schapire, Sellie (bib024) 1994; 17 O. Goldreich, Combinatorial property testing—a survey, in: Randomization Methods in Algorithm Design, 1998, pp. 45–60 M. Charikar, L. O'Callaghan, R. Panigraphy, Better streaming algorithms for clustering problems, in: Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing, STOC, 2003, pp. 30–39 Batu, Rubinfeld, White (bib007) 2005; 196 B. Chazelle, R. Rubinfeld, L. Trevisan, Approximating the minimum spanning tree weight in sublinear time, in: Automata, Languages and Programming: Twenty-Eighth International Colloquium, ICALP, 2001, pp. 190–200 Fischer (bib015) 2004; 189 Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron, A. Samorodnitsky, Improved testing algorithms for monotonicity, in: Proceedings of the Third International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM, 1999, pp. 97–108 N. Ailon, B. Chazelle, S. Comandur, D. Liu, Estimating the distance to a monotone function, in: Proceedings of the Eight International Workshop on Randomization and Computation, RANDOM, 2004, 229–236 N. Alon, A. Shapira, A characterization of the (natural) graph properties testable with one-sided error, in: Proceedings of the Forty-Sixth Annual Symposium on Foundations of Computer Science, FOCS, 2005, pp. 429–438 S. Halevy, E. Kushilevitz, Testing monotonicity over graph products, in: Automata, Languages and Programming: Thirty-First International Colloquium, ICALP, 2004, pp. 721–732 Czumaj, Sohler (bib011) 2005; 34 Goldreich, Goldwasser, Ron (bib020) 1998; 45 E. Fischer, E. Lehman, I. Newman, S. Raskhodnikova, R. Rubinfeld, A. Samorodnitsky, Monotonicity testing over general poset domains, in: Proceedings of the Thirty-Fourth Annual ACM Symposium on the Theory of Computing, STOC, 2002, pp. 474–483 E. Fischer, I. Newman, Testing versus estimation of graph properties, in: Proceedings of the Thirty-Sixth Annual ACM Symposium on the Theory of Computing, STOC, 2005, pp. 138–146 Alon, Dar, Parnas, Ron (bib003) 2003; 16 Rubinfeld, Sudan (bib027) 1996; 25 Batu (10.1016/j.jcss.2006.03.002_bib007) 2005; 196 10.1016/j.jcss.2006.03.002_bib012 10.1016/j.jcss.2006.03.002_bib017 10.1016/j.jcss.2006.03.002_bib018 10.1016/j.jcss.2006.03.002_bib016 Ron (10.1016/j.jcss.2006.03.002_bib026) 2001 Goldreich (10.1016/j.jcss.2006.03.002_bib019) 2000; 20 10.1016/j.jcss.2006.03.002_bib010 Czumaj (10.1016/j.jcss.2006.03.002_bib011) 2005; 34 Kearns (10.1016/j.jcss.2006.03.002_bib024) 1994; 17 Fischer (10.1016/j.jcss.2006.03.002_bib014) 2001; 75 10.1016/j.jcss.2006.03.002_bib009 Ergun (10.1016/j.jcss.2006.03.002_bib013) 2000; 60 Rubinfeld (10.1016/j.jcss.2006.03.002_bib027) 1996; 25 10.1016/j.jcss.2006.03.002_bib002 10.1016/j.jcss.2006.03.002_bib022 10.1016/j.jcss.2006.03.002_bib001 10.1016/j.jcss.2006.03.002_bib023 10.1016/j.jcss.2006.03.002_bib006 Parnas (10.1016/j.jcss.2006.03.002_bib025) 10.1016/j.jcss.2006.03.002_bib004 10.1016/j.jcss.2006.03.002_bib005 10.1016/j.jcss.2006.03.002_bib021 Alon (10.1016/j.jcss.2006.03.002_bib003) 2003; 16 Fischer (10.1016/j.jcss.2006.03.002_bib015) 2004; 189 Blum (10.1016/j.jcss.2006.03.002_bib008) 1993; 47 Goldreich (10.1016/j.jcss.2006.03.002_bib020) 1998; 45 |
| References_xml | – volume: 25 start-page: 252 year: 1996 end-page: 271 ident: bib027 article-title: Robust characterization of polynomials with applications to program testing publication-title: SIAM J. Comput. – reference: Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron, A. Samorodnitsky, Improved testing algorithms for monotonicity, in: Proceedings of the Third International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM, 1999, pp. 97–108 – volume: 189 start-page: 107 year: 2004 end-page: 116 ident: bib015 article-title: On the strength of comparisons in property testing publication-title: Inform. and Comput. – reference: N. Ailon, B. Chazelle, S. Comandur, D. Liu, Estimating the distance to a monotone function, in: Proceedings of the Eight International Workshop on Randomization and Computation, RANDOM, 2004, 229–236 – volume: 17 start-page: 115 year: 1994 end-page: 141 ident: bib024 article-title: Toward efficient agnostic learning publication-title: Machine Learning – reference: E. Fischer, E. Lehman, I. Newman, S. Raskhodnikova, R. Rubinfeld, A. Samorodnitsky, Monotonicity testing over general poset domains, in: Proceedings of the Thirty-Fourth Annual ACM Symposium on the Theory of Computing, STOC, 2002, pp. 474–483 – start-page: 597 year: 2001 end-page: 649 ident: bib026 article-title: Property testing publication-title: Handbook on Randomization, vol. II – volume: 20 start-page: 301 year: 2000 end-page: 337 ident: bib019 article-title: Testing monotonicity publication-title: Combinatorica – volume: 47 start-page: 549 year: 1993 end-page: 595 ident: bib008 article-title: Self-testing/correcting with applications to numerical problems publication-title: J. ACM – reference: N. Ailon, B. Chazelle, Information theory in property testing and monotonicity testing in higher dimensions, in: Proceedings of the Twenty-Second Annual Symposium on Theoretical Aspects of Computer Science, STACS, 2005, pp. 434–447 – reference: T. Batu, L. Fortnow, R. Rubinfeld, W. Smith, P. White, Testing that distributions are close, in: Proceedings of the Forty-First Annual Symposium on Foundations of Computer Science, FOCS, 2000, pp. 259–269 – volume: 196 start-page: 42 year: 2005 end-page: 56 ident: bib007 article-title: Fast approximate PCPs for multidimensional bin-packing problems publication-title: Inform. and Comput. – volume: 16 start-page: 393 year: 2003 end-page: 417 ident: bib003 article-title: Testing of clustering publication-title: SIAM J. Discrete Math. – reference: V. Guruswami, A. Rudra, Tolerant locally testable codes, in: Proceedings of the Ninth International Workshop on Randomization and Computation, RANDOM, 2005, pp. 306–317 – reference: S. Halevy, E. Kushilevitz, Distribution-free property testing, in: Proceedings of the Seventh International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM, 2003, pp. 302–317 – year: 2004 ident: bib025 article-title: Tolerant property testing and distance approximation – reference: T. Batu, F. Ergun, J. Kilian, A. Magen, S. Raskhodnikova, R. Rubinfeld, Rahul Sami, A sublinear algorithm for weakly approximating edit distance, in: Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing, STOC, 2003, pp. 316–324 – reference: O. Goldreich, Combinatorial property testing—a survey, in: Randomization Methods in Algorithm Design, 1998, pp. 45–60 – volume: 60 start-page: 717 year: 2000 end-page: 751 ident: bib013 article-title: Spot-checkers publication-title: J. Comput. System Sci. – reference: E. Fischer, I. Newman, Testing versus estimation of graph properties, in: Proceedings of the Thirty-Sixth Annual ACM Symposium on the Theory of Computing, STOC, 2005, pp. 138–146 – reference: B. Chazelle, R. Rubinfeld, L. Trevisan, Approximating the minimum spanning tree weight in sublinear time, in: Automata, Languages and Programming: Twenty-Eighth International Colloquium, ICALP, 2001, pp. 190–200 – reference: N. Alon, A. Shapira, A characterization of the (natural) graph properties testable with one-sided error, in: Proceedings of the Forty-Sixth Annual Symposium on Foundations of Computer Science, FOCS, 2005, pp. 429–438 – volume: 75 start-page: 97 year: 2001 end-page: 126 ident: bib014 article-title: The art of uninformed decisions: A primer to property testing publication-title: Bull. Eur. Assoc. Theor. Comput. Sci. – volume: 45 start-page: 653 year: 1998 end-page: 750 ident: bib020 article-title: Property testing and its connection to learning and approximation publication-title: J. ACM – reference: S. Halevy, E. Kushilevitz, Testing monotonicity over graph products, in: Automata, Languages and Programming: Thirty-First International Colloquium, ICALP, 2004, pp. 721–732 – reference: M. Charikar, L. O'Callaghan, R. Panigraphy, Better streaming algorithms for clustering problems, in: Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing, STOC, 2003, pp. 30–39 – volume: 34 start-page: 580 year: 2005 end-page: 615 ident: bib011 article-title: Abstract combinatorial programs and efficient property testers publication-title: SIAM J. Comput. – ident: 10.1016/j.jcss.2006.03.002_bib001 doi: 10.1007/978-3-540-31856-9_36 – ident: 10.1016/j.jcss.2006.03.002_bib018 doi: 10.1090/dimacs/043/04 – ident: 10.1016/j.jcss.2006.03.002_bib004 doi: 10.1109/SFCS.2005.5 – ident: 10.1016/j.jcss.2006.03.002_bib017 doi: 10.1145/1060590.1060612 – ident: 10.1016/j.jcss.2006.03.002_bib021 doi: 10.1007/11538462_26 – ident: 10.1016/j.jcss.2006.03.002_bib025 – ident: 10.1016/j.jcss.2006.03.002_bib002 doi: 10.1007/978-3-540-27821-4_21 – volume: 20 start-page: 301 issue: 3 year: 2000 ident: 10.1016/j.jcss.2006.03.002_bib019 article-title: Testing monotonicity publication-title: Combinatorica doi: 10.1007/s004930070011 – volume: 45 start-page: 653 issue: 4 year: 1998 ident: 10.1016/j.jcss.2006.03.002_bib020 article-title: Property testing and its connection to learning and approximation publication-title: J. ACM doi: 10.1145/285055.285060 – start-page: 597 year: 2001 ident: 10.1016/j.jcss.2006.03.002_bib026 article-title: Property testing – volume: 60 start-page: 717 issue: 3 year: 2000 ident: 10.1016/j.jcss.2006.03.002_bib013 article-title: Spot-checkers publication-title: J. Comput. System Sci. doi: 10.1006/jcss.1999.1692 – ident: 10.1016/j.jcss.2006.03.002_bib009 doi: 10.1145/780542.780548 – volume: 189 start-page: 107 issue: 1 year: 2004 ident: 10.1016/j.jcss.2006.03.002_bib015 article-title: On the strength of comparisons in property testing publication-title: Inform. and Comput. doi: 10.1016/j.ic.2003.09.003 – ident: 10.1016/j.jcss.2006.03.002_bib012 doi: 10.1007/978-3-540-48413-4_10 – volume: 196 start-page: 42 issue: 1 year: 2005 ident: 10.1016/j.jcss.2006.03.002_bib007 article-title: Fast approximate PCPs for multidimensional bin-packing problems publication-title: Inform. and Comput. doi: 10.1016/j.ic.2004.10.001 – volume: 17 start-page: 115 issue: 2–3 year: 1994 ident: 10.1016/j.jcss.2006.03.002_bib024 article-title: Toward efficient agnostic learning publication-title: Machine Learning doi: 10.1007/BF00993468 – ident: 10.1016/j.jcss.2006.03.002_bib010 doi: 10.1007/3-540-48224-5_16 – ident: 10.1016/j.jcss.2006.03.002_bib022 doi: 10.1007/978-3-540-45198-3_26 – volume: 25 start-page: 252 issue: 2 year: 1996 ident: 10.1016/j.jcss.2006.03.002_bib027 article-title: Robust characterization of polynomials with applications to program testing publication-title: SIAM J. Comput. doi: 10.1137/S0097539793255151 – volume: 75 start-page: 97 year: 2001 ident: 10.1016/j.jcss.2006.03.002_bib014 article-title: The art of uninformed decisions: A primer to property testing publication-title: Bull. Eur. Assoc. Theor. Comput. Sci. – ident: 10.1016/j.jcss.2006.03.002_bib006 doi: 10.1109/SFCS.2000.892113 – volume: 34 start-page: 580 issue: 3 year: 2005 ident: 10.1016/j.jcss.2006.03.002_bib011 article-title: Abstract combinatorial programs and efficient property testers publication-title: SIAM J. Comput. doi: 10.1137/S009753970444199X – volume: 16 start-page: 393 issue: 3 year: 2003 ident: 10.1016/j.jcss.2006.03.002_bib003 article-title: Testing of clustering publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480102410973 – ident: 10.1016/j.jcss.2006.03.002_bib016 doi: 10.1145/509973.509977 – ident: 10.1016/j.jcss.2006.03.002_bib005 doi: 10.1145/780542.780590 – volume: 47 start-page: 549 year: 1993 ident: 10.1016/j.jcss.2006.03.002_bib008 article-title: Self-testing/correcting with applications to numerical problems publication-title: J. ACM – ident: 10.1016/j.jcss.2006.03.002_bib023 doi: 10.1007/978-3-540-27836-8_61 |
| SSID | ssj0011563 |
| Score | 2.2617142 |
| Snippet | In this paper we study a generalization of standard property testing where the algorithms are required to be more
tolerant with respect to objects that do not... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 1012 |
| SubjectTerms | Approximation Clustering Property testing Sublinear algorithms |
| Title | Tolerant property testing and distance approximation |
| URI | https://dx.doi.org/10.1016/j.jcss.2006.03.002 |
| Volume | 72 |
| WOSCitedRecordID | wos000240202500004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1090-2724 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0011563 issn: 0022-0000 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3da9RAEF_06oN9sFqVVqvkwbcjktvdZLOPRSoqUspR5d7CfiTQo6ZHk5b78zuT_bi0lqKCLyGE3YTs_JiZ3Zn5DSEfmG1UkQuaFg3lWJKjUyksS3PBbWNkbvnQh-znd3F8XC4W8sSnBHVDOwHRtuV6LVf_VdTwDISNpbN_Ie74UngA9yB0uILY4fpngr84r8EA9Zh6tULm3GmPTBq-FtGivzhUCSCZ-Prs10Yyv7uoxrd8GGY6zuepN5nRFT9RMLqLGfgxYWPuwvmAqqj451cac7_cUfQclUl_99BBjg8dYjXMrWTNoTIADaCzLU6hZjJLqXB10kHjCjpC1lh9ItnYyBTDVpHeq-bdicPy49J0nQ8oIVEt3Ri1mGqI0Wg6bIWKIXrNH5MtKnJZTsjW4dejxbcYc4KdLAvc8jjel1i5bMC7X7rfjRm5JqfPyTMvsOTQYeEFeVS3u2Qn9OtIvPreJdsj8smXhAegJAEoiQdKAuJOAlCSW0B5RX58Pjr99CX1PTRSw7KsT5vCKvA4Z6pssMOJZrPaatPAPoFrzgpBVZnD7-iMNloXsrBZzSUtlZBUU8FL9ppM2ou23iNJUXKlZ4qDz2u5gY2p4rqGF2olGskM3yezsCSV8QTz2OfkvAqZhMsKlxE7nxZVxir47j6ZxjkrR6_y4Og8rHTl0e4cvwqA8cC8N_847y15ugH_AZn0l1f1O_LEXPdn3eV7j58bwq-J4A |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Tolerant+property+testing+and+distance+approximation&rft.jtitle=Journal+of+computer+and+system+sciences&rft.au=Parnas%2C+Michal&rft.au=Ron%2C+Dana&rft.au=Rubinfeld%2C+Ronitt&rft.date=2006-09-01&rft.pub=Elsevier+Inc&rft.issn=0022-0000&rft.eissn=1090-2724&rft.volume=72&rft.issue=6&rft.spage=1012&rft.epage=1042&rft_id=info:doi/10.1016%2Fj.jcss.2006.03.002&rft.externalDocID=S0022000006000444 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0022-0000&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0022-0000&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0022-0000&client=summon |