{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:36:27Z","timestamp":1742934987104,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540693208"},{"type":"electronic","value":"9783540693215"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69321-5_1","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:38:25Z","timestamp":1217486305000},"page":"1-10","source":"Crossref","is-referenced-by-count":5,"title":["MAP-Inference for Highly-Connected Graphs with DC-Programming"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"Kappes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Schn\u00f6rr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Mosek 5.0 , \n                      http:\/\/www.mosek.com"},{"issue":"24","key":"1_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"L.T.H. An","year":"2005","unstructured":"An, L.T.H., Tao, P.D.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Annals of Operations Research\u00a0133(24), 23\u201346 (2005)","journal-title":"Annals of Operations Research"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Bergtholdt, M., Kappes, J.H., Schn\u00f6rr, C.: Learning of graphical models and efficient inference for object class recognition. In: 28th Annual Symposium of the German Association for Pattern Recognition (September 2006)","DOI":"10.1007\/11861898_28"},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1021765131316","volume":"103","author":"R. Horst","year":"1999","unstructured":"Horst, R., Thoai, N.V.: DC programming: Overview. J.\u00a0Optimiz.\u00a0Theory Appl.\u00a0103(1), 1\u201343 (1999)","journal-title":"J.\u00a0Optimiz.\u00a0Theory Appl."},{"issue":"10","key":"1_CR5","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. IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell.\u00a028(10), 1568\u20131583 (2006)","journal-title":"IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell."},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Vision \u2013 ECCV 2006","author":"V. Kolmogorov","year":"2006","unstructured":"Kolmogorov, V., Rother, C.: Comparison of energy minimization algorithms for highly connected graphs. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol.\u00a03954. Springer, Heidelberg (2006)"},{"issue":"8","key":"1_CR7","doi-asserted-by":"crossref","first-page":"2649","DOI":"10.1109\/TPAMI.2007.1061","volume":"29","author":"N. Komodakis","year":"2007","unstructured":"Komodakis, N., Tziritas, G.: Approximate labeling via graph cuts based on linear programming. PAMI\u00a029(8), 2649\u20132661 (2007)","journal-title":"PAMI"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Kumar, M.P., Kolmogorov, V., Torr, P.H.S.: An analysis of convex relaxations for MAP estimation. In: Proceedings of Advances in Neural Information Processing Systems (2007)","DOI":"10.1145\/1390156.1390242"},{"key":"1_CR9","first-page":"1045","volume-title":"CVPR 2006: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition","author":"M. Pawan Kumar","year":"2006","unstructured":"Pawan Kumar, M., Torr, P.H.S., Zisserman, A.: Solving markov random fields using second order cone programming relaxations. In: CVPR 2006: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Washington, DC, USA, pp. 1045\u20131052. IEEE Computer Society, Los Alamitos (2006)"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1145\/1143844.1143937","volume-title":"ICML 2006: Proceedings of the 23rd international conference on Machine learning","author":"P. Ravikumar","year":"2006","unstructured":"Ravikumar, P., Lafferty, J.: Quadratic programming relaxations for metric labeling and markov random field MAP estimation. In: ICML 2006: Proceedings of the 23rd international conference on Machine learning, pp. 737\u2013744. ACM Press, New York (2006)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Vision \u2013 ECCV 2006","author":"R. Szeliski","year":"2006","unstructured":"Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M.F., Rother, C.: A comparative study of energy minimization methods for markov random fields. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol.\u00a03954. Springer, Heidelberg (2006)"},{"issue":"11","key":"1_CR12","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., Jaakola, T.S., Willsky, A.S.: MAP estimation via agreement on trees: message-passing and linear programming. IEEE Trans.\u00a0Inform.\u00a0Theory\u00a051(11), 3697\u20133717 (2005)","journal-title":"IEEE Trans.\u00a0Inform.\u00a0Theory"},{"issue":"7","key":"1_CR13","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TPAMI.2007.1036","volume":"29","author":"T. Werner","year":"2007","unstructured":"Werner, T.: A linear programming approach to max-sum problem: A review. IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell.\u00a029(7), 1165\u20131179 (2007)","journal-title":"IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell."},{"issue":"7","key":"1_CR14","doi-asserted-by":"publisher","first-page":"2282","DOI":"10.1109\/TIT.2005.850085","volume":"51","author":"J.S. Yedidia","year":"2005","unstructured":"Yedidia, J.S., Freeman, W.T., Weiss, Y.: Constructing free-energy approximations and generalized belief propagation algorithms. IEEE Transactions on Information Theory\u00a051(7), 2282\u20132312 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"1_CR15","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1162\/08997660260028674","volume":"14","author":"A.L. Yuille","year":"2002","unstructured":"Yuille, A.L.: CCCP algorithms to minimize the bethe and kikuchi free energies: convergent alternatives to belief propagation. Neural Comput.\u00a014(7), 1691\u20131722 (2002)","journal-title":"Neural Comput."}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69321-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T13:32:35Z","timestamp":1675085555000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-69321-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540693208","9783540693215"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69321-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}