{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:15:14Z","timestamp":1725542114008},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620676","type":"proceedings-article","created":{"date-parts":[[2013,10,12]],"date-time":"2013-10-12T02:57:32Z","timestamp":1381546652000},"page":"2498-2502","source":"Crossref","is-referenced-by-count":2,"title":["Sampling from Gaussian graphical models using subgraph perturbations"],"prefix":"10.1109","author":[{"given":"Ying","family":"Liu","sequence":"first","affiliation":[]},{"given":"Oliver","family":"Kosut","sequence":"additional","affiliation":[]},{"given":"Alan S.","family":"Willsky","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"Learning thin junction trees via graph cuts","author":"shahaf","year":"2009","journal-title":"Proc Conf Artif Intell Statist"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2195656"},{"key":"18","first-page":"504","article-title":"Maximum likelihood bounded tree-width Markov networks","author":"srebro","year":"2001","journal-title":"Proc 10th Conf Uncertainty in Artificial Intell"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1137\/0613052"},{"key":"16","first-page":"392","article-title":"Learning Markov networks: Maximum bounded tree-width graphs","author":"karger","year":"2001","journal-title":"Proc Annu ACM-SIAM Symp Discrete Algorithm"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717907"},{"journal-title":"Matrix Analysis","year":"1990","author":"horn","key":"14"},{"key":"11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4145-2","author":"robert","year":"2004","journal-title":"Monte Carlo Statistical Methods"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479801384019"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.927482"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/81.3.541"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1137\/08074489X"},{"journal-title":"Pattern Recognition and Machine Learning","year":"2006","author":"bishop","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539951"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008947712763"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2004.836539"},{"key":"6","first-page":"243","article-title":"From fields to trees","author":"hamze","year":"2004","journal-title":"Proc 10th Conf Uncertainty in Artificial Intell"},{"key":"5","article-title":"Gaussian sampling by local perturbations","author":"papandreou","year":"2010","journal-title":"Proc NIPS"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9868.00288"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1214\/088342304000000026"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.912280"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620676.pdf?arnumber=6620676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T23:46:04Z","timestamp":1498088764000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620676\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620676","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}