乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T19:05:08Z","timestamp":1730315108272,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,6]]},"DOI":"10.1145\/1993636.1993742","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T07:53:52Z","timestamp":1307346832000},"page":"803-812","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":43,"title":["Privately releasing conjunctions and the statistical query barrier"],"prefix":"10.1145","author":[{"given":"Anupam","family":"Gupta","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburg, PA, USA"}]},{"given":"Moritz","family":"Hardt","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}]},{"given":"Aaron","family":"Roth","sequence":"additional","affiliation":[{"name":"Microsoft Research --- New England Campus, Cambridge, MA, USA"}]},{"given":"Jonathan","family":"Ullman","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"The multiplicative weights update method: a meta algorithm and applications. Technical report","author":"Arora S.","year":"2005","unstructured":"S. Arora , E. Hazan , and S. Kale . The multiplicative weights update method: a meta algorithm and applications. Technical report , Princeton University , 2005 . S. Arora, E. Hazan, and S. Kale. The multiplicative weights update method: a meta algorithm and applications. Technical report, Princeton University, 2005."},{"key":"e_1_3_2_2_2_1","volume-title":"Learning submodular functions. Arxiv preprint arXiv:1008.2159","author":"Balcan M.","year":"2010","unstructured":"M. Balcan and N. Harvey . Learning submodular functions. Arxiv preprint arXiv:1008.2159 , 2010 . M. Balcan and N. Harvey. Learning submodular functions. Arxiv preprint arXiv:1008.2159, 2010."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265569"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065184"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195147"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374464"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(200005)16:3%3C277::AID-RSA4%3E3.0.CO;2-1"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v14-690"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773173"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511581274","volume-title":"Concentration of Measure for the Analysis of Randomized Algorithms","author":"Dubhashi D.","year":"2009","unstructured":"D. Dubhashi and A. Panconesi . Concentration of Measure for the Analysis of Randomized Algorithms . 2009 . D. Dubhashi and A. Panconesi. Concentration of Measure for the Analysis of Randomized Algorithms. 2009."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536467"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.35"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496829"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.85"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806786"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2009.93"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.27"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806795"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293351"},{"key":"e_1_3_2_2_21_1","first-page":"1650","volume-title":"Proceedings of the National Conference on Artificial Intelligence","volume":"22","author":"Krause A.","unstructured":"A. Krause and C. Guestrin . Near-optimal observation selection using submodular functions . In Proceedings of the National Conference on Artificial Intelligence , volume 22 , page 1650 . Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999, 2007. A. Krause and C. Guestrin. Near-optimal observation selection using submodular functions. In Proceedings of the National Conference on Artificial Intelligence, volume 22, page 1650. Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999, 2007."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1009"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806794"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.66"},{"key":"e_1_3_2_2_25_1","volume-title":"Pcps and the hardness of generating synthetic data. Electronic Colloquium on Computational Complexity (ECCC), 17:17","author":"Ullman J.","year":"2010","unstructured":"J. Ullman and S. P. Vadhan . Pcps and the hardness of generating synthetic data. Electronic Colloquium on Computational Complexity (ECCC), 17:17 , 2010 . J. Ullman and S. P. Vadhan. Pcps and the hardness of generating synthetic data. Electronic Colloquium on Computational Complexity (ECCC), 17:17, 2010."},{"key":"e_1_3_2_2_26_1","volume-title":"A note on concentration of submodular functions. Arxiv preprint arXiv:1005.2791","author":"Vondrak J.","year":"2010","unstructured":"J. Vondrak . A note on concentration of submodular functions. Arxiv preprint arXiv:1005.2791 , 2010 . J. Vondrak. A note on concentration of submodular functions. Arxiv preprint arXiv:1005.2791, 2010."}],"event":{"name":"STOC'11: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Jose California USA","acronym":"STOC'11"},"container-title":["Proceedings of the forty-third annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993636.1993742","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T14:39:08Z","timestamp":1673102348000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993742"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":26,"alternative-id":["10.1145\/1993636.1993742","10.1145\/1993636"],"URL":"https:\/\/doi.org\/10.1145\/1993636.1993742","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}