{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:35:56Z","timestamp":1725572156410},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228233"},{"type":"electronic","value":"9783540286295"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28629-5_6","type":"book-chapter","created":{"date-parts":[[2010,12,17]],"date-time":"2010-12-17T17:59:50Z","timestamp":1292608790000},"page":"106-118","source":"Crossref","is-referenced-by-count":1,"title":["Theory and Applied Computing: Observations and Anecdotes"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Brand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarah","family":"Frisken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neal","family":"Lesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Marks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Nikovski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron","family":"Perry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Yedidia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","volume-title":"Dynamic Programming and Optimal Control","author":"D.P. Bertsekas","year":"2000","unstructured":"Bertsekas, D.P.: Dynamic Programming and Optimal Control, vol.\u00a01 and 2. Athena Scientific, Belmont (2000)"},{"key":"6_CR2","first-page":"10","volume":"91","author":"K. Yokouchi","year":"2000","unstructured":"Yokouchi, K., Ideno, H., Ota, M.: Car-navigation systems. Mitsubishi Electric Advance\u00a091, 10\u201314 (2000)","journal-title":"Mitsubishi Electric Advance"},{"key":"6_CR3","unstructured":"Nishiuma, N., Kumazawa, H., Goto, Y., Nikovski, D., Brand, M.: Traffic prediction using singular value decomposition. In: Proceedings of the 11th ITS World Congress (to appear), Nagoya, Japan (2004)"},{"key":"6_CR4","volume-title":"Artificial Life IV: Proceedings of the Fourth International Workshop on the Synthesis and Simulation of Living Systems","author":"K. Nagel","year":"1994","unstructured":"Nagel, K., Rasmussen, S.: Traffic at the edge of chaos. In: Artificial Life IV: Proceedings of the Fourth International Workshop on the Synthesis and Simulation of Living Systems, MIT Press, Cambridge (1994)"},{"key":"6_CR5","first-page":"133","volume-title":"13th International Conference on Automated Planning and Scheduling","author":"D. Nikovski","year":"2003","unstructured":"Nikovski, D., Brand, M.: Decision-theoretic group elevator scheduling. In: 13th International Conference on Automated Planning and Scheduling, Trento, Italy, pp. 133\u2013142. AAAI, Menlo Park (2003)"},{"key":"6_CR6","unstructured":"Klau, G., Lesh, N., Marks, J., Mitzenmacher, M.: Human-guided tabu search. In: Proceedings of AAAI 2002, pp. 41\u201347 (2002)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Lesh, N., Mitzenmacher, M., Whitesides, S.: A complete and effective move set for simplified protein folding. In: Proceedings of the 7th Intl. Conf. on Research in Computational Molecular Biology, pp. 188\u2013195 (2003)","DOI":"10.1145\/640075.640099"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Lesh, N., Marks, J., McMahon, A., Mitzenmacher, M.: New exhaustive, heuristic, and interactive approaches to 2D rectangular strip packing. Technical Report TR2003-05, Mitsubishi Electric Research Laboratories, MERL (2003)","DOI":"10.1145\/1064546.1083322"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.ipl.2004.01.006","volume":"90","author":"N. Lesh","year":"2004","unstructured":"Lesh, N., Marks, J., McMahon, A., Mitzenmacher, M.: Exhaustive approaches to 2D rectangular perfect packings. Information Processing Letters\u00a090, 7\u201314 (2004)","journal-title":"Information Processing Letters"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B.S. Baker","year":"1980","unstructured":"Baker, B.S., Coffman, E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM Journal on Computing\u00a09, 846\u2013855 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR11","first-page":"239","volume-title":"Exploring Artificial Intelligence in the New Millenium","author":"J.S. Yedidia","year":"2003","unstructured":"Yedidia, J.S., Freeman, W.T., Weiss, Y.: Understanding belief propagation and its generalizations. In: Lakemeyer, G., Nebel, B. (eds.) Exploring Artificial Intelligence in the New Millenium, pp. 239\u2013269. Morgan Kaufmann, San Francisco (2003)"},{"key":"6_CR12","unstructured":"Yedidia, J.S., Freeman, W.T., Weiss, Y.: Constructing free energy approximations and generalized belief propagation algorithms. Technical Report TR2004-040, Mitsubishi Electric Research Laboratories, MERL (2004)"},{"key":"6_CR13","unstructured":"Welling, M., Teh, Y.W.: Belief optimization for binary networks: A stable alternative to belief propagation. In: Proceedings of the Conference on Uncertainty in Artificial Intelligence, pp. 554\u2013561 (2001)"},{"key":"6_CR14","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 Computation\u00a014, 1691\u20131722 (2002)","journal-title":"Neural Computation"},{"key":"6_CR15","unstructured":"Shibuya, T., Harada, K., Tohyama, R., Sakaniwa, K.: Iterative decoding based on concave-convex procedure (in review) (2004)"},{"key":"6_CR16","unstructured":"Yedidia, J.S., Freeman, W.T., Weiss, Y.: Characterizing belief propagation and its generalizations. Technical Report TR2001-15, Mitsubishi Electric Research Laboratories, MERL (2001)"},{"key":"6_CR17","unstructured":"Yedidia, J.S., Chen, J., Fossorier, M.: Generating code representations suitable for belief propagation decoding. In: Proceedings of the 40th Allerton Conference on Commmunication, Control, and Computing (2002)"},{"key":"6_CR18","volume-title":"Advances in Neural Information Processing Systems","author":"M.F. Tappen","year":"2003","unstructured":"Tappen, M.F., Freeman, W.T., Adelson, E.H.: Recovering intrinsic images from a single image. In: Advances in Neural Information Processing Systems, vol.\u00a015, MIT Press, Cambridge (2003)"},{"key":"6_CR19","unstructured":"Dauwels, J., Loeliger, H.A., Merkli, P., Ostojic, M.: Structured-summary propagation, LFSR synchronization, and low-complexity trellis decoding. In: Proceedings of the 41st Allerton Conference on Communication, Control, and Computing, pp. 459\u2013467 (2003)"},{"key":"6_CR20","volume-title":"Advances in Neural Information Processing Systems 16","author":"A. Storkey","year":"2004","unstructured":"Storkey, A.: Generalized propagation for fast fourier transforms with partial or missing data. In: Advances in Neural Information Processing Systems 16, MIT Press, Cambridge (2004)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/3-540-47969-4_47","volume-title":"Computer Vision - ECCV 2002","author":"M. Brand","year":"2002","unstructured":"Brand, M.: Incremental singular value decomposition of uncertain data with missing values. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol.\u00a02350, pp. 707\u2013720. Springer, Heidelberg (2002)"},{"key":"6_CR22","first-page":"547","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence","author":"M. Brand","year":"2003","unstructured":"Brand, M.: Continuous nonlinear dimensionality reduction by kernel eigenmaps. In: Gottlob, G., Walsh, T. (eds.) Proceedings of the International Joint Conference on Artificial Intelligence, San Mateo, CA, pp. 547\u2013552. Morgan Kaufmann, San Francisco (2003)"},{"key":"6_CR23","unstructured":"Adode Systems, Inc.: Adobe Type 1 Font Format. Addison Wesley (1990)"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Frisken, S., Perry, R., Rockwood, A., Jones, T.: Adaptively sampled distance fields: A general representation of shape for computer graphics. In: Proceedings of SIGGRAPH 2000, pp. 249\u2013254 (2000)","DOI":"10.1145\/344779.344899"},{"key":"6_CR25","unstructured":"Perry, R., Frisken, S.: A new framework for representing, rendering, editing, and animating type (in preparation)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28629-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:25:48Z","timestamp":1605759948000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28629-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228233","9783540286295"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28629-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}