{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:44Z","timestamp":1750221284252,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,15]],"date-time":"2017-10-15T00:00:00Z","timestamp":1508025600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1162267, CCF-1525925, CCF-1525749"],"award-info":[{"award-number":["CCF-1162267, CCF-1525925, CCF-1525749"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,15]]},"DOI":"10.1145\/3125501.3125511","type":"proceedings-article","created":{"date-parts":[[2017,10,16]],"date-time":"2017-10-16T12:37:48Z","timestamp":1508157468000},"page":"1-2","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A quantifiable approach to approximate computing"],"prefix":"10.1145","author":[{"given":"Chaofan","family":"Li","sequence":"first","affiliation":[{"name":"Texas A&M University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepashree","family":"Sengupta","sequence":"additional","affiliation":[{"name":"University of Minnesota"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farhana Sharmin","family":"Snigdha","sequence":"additional","affiliation":[{"name":"University of Minnesota"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenbin","family":"Xu","sequence":"additional","affiliation":[{"name":"Texas A&M University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiang","family":"Hu","sequence":"additional","affiliation":[{"name":"Texas A&M University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sachin S.","family":"Sapatnekar","sequence":"additional","affiliation":[{"name":"University of Minnesota"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,10,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062319"},{"volume-title":"Proceedings of the IEEE International Symposium on Quality Electronic Design. 438--444","author":"Fan Q.","key":"e_1_3_2_1_2_1","unstructured":"Q. Fan , D. J. Lilja , and S. S. Sapatnekar . 2017. Cost-Quality Trade-offs of Approximate Memory Repair Mechanisms for Image Data . In Proceedings of the IEEE International Symposium on Quality Electronic Design. 438--444 . Q. Fan, D. J. Lilja, and S. S. Sapatnekar. 2017. Cost-Quality Trade-offs of Approximate Memory Repair Mechanisms for Image Data. In Proceedings of the IEEE International Symposium on Quality Electronic Design. 438--444."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2012.2217962"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ETS.2013.6569370"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228509"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2744863"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2016.2605382"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429384.2429542"},{"volume-title":"Proceedings of the IEEE Design, Automation, and Test in Europe.","author":"Nepal K.","key":"e_1_3_2_1_9_1","unstructured":"K. Nepal , Y. Li , R. I. Bahar , and S. Reda . 2014. ABACUS: A Technique for Automated Behavioral synthesis of Approximate Computing Circuits . In Proceedings of the IEEE Design, Automation, and Test in Europe. K. Nepal, Y. Li, R. I. Bahar, and S. Reda. 2014. ABACUS: A Technique for Automated Behavioral synthesis of Approximate Computing Circuits. In Proceedings of the IEEE Design, Automation, and Test in Europe."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2744799"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2540708.2540712"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2015.7372583"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062314"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2898057"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISLPED.2017.8009206"}],"event":{"name":"ESWEEK'17: THIRTEENTH EMBEDDED SYSTEM WEEK","acronym":"ESWEEK'17","location":"Seoul Republic of Korea"},"container-title":["Proceedings of the 2017 International Conference on Compilers, Architectures and Synthesis for Embedded Systems Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3125501.3125511","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3125501.3125511","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3125501.3125511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:23Z","timestamp":1750212683000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3125501.3125511"}},"subtitle":["special session"],"short-title":[],"issued":{"date-parts":[[2017,10,15]]},"references-count":15,"alternative-id":["10.1145\/3125501.3125511","10.1145\/3125501"],"URL":"https:\/\/doi.org\/10.1145\/3125501.3125511","relation":{},"subject":[],"published":{"date-parts":[[2017,10,15]]},"assertion":[{"value":"2017-10-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}