{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T15:25:00Z","timestamp":1760369100832,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642337857"},{"type":"electronic","value":"9783642337864"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33786-4_12","type":"book-chapter","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T08:04:51Z","timestamp":1348646691000},"page":"154-166","source":"Crossref","is-referenced-by-count":14,"title":["The Lazy Flipper: Efficient Depth-Limited Exhaustive Search in Discrete Graphical Models"],"prefix":"10.1007","author":[{"given":"Bjoern","family":"Andres","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg H.","family":"Kappes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thorsten","family":"Beier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ullrich","family":"K\u00f6the","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred A.","family":"Hamprecht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1109\/TPAMI.2007.70844","volume":"30","author":"R. Szeliski","year":"2008","unstructured":"Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., Rother, C.: A comparative study of energy minimization methods for markov random fields with smoothness-based priors. TPAMI\u00a030, 1068\u20131080 (2008)","journal-title":"TPAMI"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Nowozin, S., Rother, C., Bagon, S., Sharp, T., Yao, B., Kohli, P.: Decision tree fields. In: ICCV (2011)","DOI":"10.1109\/ICCV.2011.6126429"},{"key":"12_CR3","unstructured":"Koller, D., Friedman, N.: Probabilistic Graphical Models. MIT Press (2009)"},{"key":"12_CR4","volume-title":"Probabilistic reasoning in intelligent systems: networks of plausible inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, San Francisco (1988)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Lauritzen, S.L.: Graphical Models. Statistical Science. Oxford (1996)","DOI":"10.1093\/oso\/9780198522195.001.0001"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. TPAMI\u00a023, 1222\u20131239 (2001)","journal-title":"TPAMI"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V. Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., Zabin, R.: What energy functions can be minimized via graph cuts? TPAMI\u00a026, 147\u2013159 (2004)","journal-title":"TPAMI"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-74198-5_3","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"D. Schlesinger","year":"2007","unstructured":"Schlesinger, D.: Exact Solution of Permuted Submodular MinSum Problems. In: Yuille, A.L., Zhu, S.-C., Cremers, D., Wang, Y. (eds.) EMMCVPR 2007. LNCS, vol.\u00a04679, pp. 28\u201338. Springer, Heidelberg (2007)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/0004-3702(94)90072-8","volume":"68","author":"S.E. Shimony","year":"1994","unstructured":"Shimony, S.E.: Finding MAPs for belief networks is NP-hard. Artificial Intelligence\u00a068, 399\u2013410 (1994)","journal-title":"Artificial Intelligence"},{"key":"12_CR10","first-page":"146","volume":"15","author":"D. Batra","year":"2011","unstructured":"Batra, D., Nowozin, S., Kohli, P.: Tighter relaxations for MAP-MRF inference: A local primal-dual gap based separation algorithm. JMLR (Proceedings Track)\u00a015, 146\u2013154 (2011)","journal-title":"JMLR (Proceedings Track)"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1109\/TPAMI.2010.108","volume":"33","author":"N. Komodakis","year":"2011","unstructured":"Komodakis, N., Paragios, N., Tziritas, G.: MRF energy minimization and beyond via Dual Decomposition. TPAMI\u00a033, 531\u2013552 (2011)","journal-title":"TPAMI"},{"key":"12_CR12","unstructured":"Sontag, D., Meltzer, T., Globerson, A., Jaakkola, T., Weiss, Y.: Tightening LP relaxations for MAP using message passing. In: UAI (2008)"},{"key":"12_CR13","volume-title":"Graphical Models, Exponential Families, and Variational Inference","author":"M.J. Wainwright","year":"2008","unstructured":"Wainwright, M.J., Jordan, M.I.: Graphical Models, Exponential Families, and Variational Inference. Now Publishers Inc., Hanover (2008)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","volume":"28","author":"V. Kolmogorov","year":"2006","unstructured":"Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. TPAMI\u00a028, 1568\u20131583 (2006)","journal-title":"TPAMI"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"3697","DOI":"10.1109\/TIT.2005.856938","volume":"51","author":"M.J. Wainwright","year":"2005","unstructured":"Wainwright, M.J., Jaakkola, T., Willsky, A.S.: MAP estimation via agreement on trees: message-passing and linear programming. Transactions on Information Theory\u00a051, 3697\u20133717 (2005)","journal-title":"Transactions on Information Theory"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1109\/TPAMI.2010.108","volume":"33","author":"N. Komodakis","year":"2011","unstructured":"Komodakis, N., Paragios, N., Tziritas, G.: MRF energy minimization and beyond via dual decomposition. TPAMI\u00a033, 531\u2013552 (2011)","journal-title":"TPAMI"},{"key":"12_CR17","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1111\/j.2517-6161.1986.tb01412.x","volume":"48","author":"J. Besag","year":"1986","unstructured":"Besag, J.: On the statisical analysis of dirty pictures. J. of the Royal Statistical Society B\u00a048, 259\u2013302 (1986)","journal-title":"J. of the Royal Statistical Society B"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1109\/TPAMI.2005.169","volume":"27","author":"B.J. Frey","year":"2005","unstructured":"Frey, B.J., Jojic, N.: A comparison of algorithms for inference and learning in probabilistic graphical models. TPAMI\u00a027, 1392\u20131416 (2005)","journal-title":"TPAMI"},{"key":"12_CR19","unstructured":"Jung, K., Kohli, P., Shah, D.: Local rules for global MAP: When do they work? In: NIPS (2009)"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1103\/PhysRevLett.58.86","volume":"58","author":"R.H. Swendsen","year":"1987","unstructured":"Swendsen, R.H., Wang, J.S.: Nonuniversal critical dynamics in monte carlo simulations. Physical Review Letters\u00a058, 86\u201388 (1987)","journal-title":"Physical Review Letters"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D. Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math.\u00a065, 21\u201346 (1996)","journal-title":"Discrete Appl. Math."},{"key":"12_CR22","unstructured":"Moerkotte, G., Neumann, T.: Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products. In: Proc.\u00a0of the 32nd Int.\u00a0Conf.\u00a0on Very Large Data Bases (2006)"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33786-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T20:28:50Z","timestamp":1714422530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33786-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642337857","9783642337864"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33786-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}