{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T20:07:18Z","timestamp":1779048438133,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,14]],"date-time":"2009-06-14T00:00:00Z","timestamp":1244937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,6,14]]},"DOI":"10.1145\/1553374.1553430","type":"proceedings-article","created":{"date-parts":[[2009,6,16]],"date-time":"2009-06-16T09:34:36Z","timestamp":1245144876000},"page":"425-432","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning linear dynamical systems without sequence information"],"prefix":"10.1145","author":[{"given":"Tzu-Kuo","family":"Huang","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeff","family":"Schneider","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1162264"},{"key":"e_1_3_2_1_2_1","volume-title":"Developments in operations research, 29--44.","author":"Bock F.","year":"1971","unstructured":"Bock, F. (1971). An algorithm to construct a minimum directed spanning tree in a directed network. In Developments in operations research, 29--44."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230090403"},{"key":"e_1_3_2_1_4_1","first-page":"1396","article-title":"On the shortest arborescence of a directed graph","volume":"14","author":"Chu Y. J.","year":"1965","unstructured":"Chu, Y. J., & Liu, T. H. (1965). On the shortest arborescence of a directed graph. Science Sinica, 14, 1396--1400.","journal-title":"Science Sinica"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.071B.032"},{"key":"e_1_3_2_1_6_1","volume-title":"Conf. on Emp. Methods in Nat. Lang. Process. -- Comp. Nat. Lang. Learn. (pp. 141--150)","author":"Globerson A.","year":"2007","unstructured":"Globerson, A., Koo, T., Carreras, X., & Collins, M. (2007). Structured prediction models via the matrix-tree theorem. Conf. on Emp. Methods in Nat. Lang. Process. -- Comp. Nat. Lang. Learn. (pp. 141--150)."},{"key":"e_1_3_2_1_7_1","volume-title":"Matrices with permanent equal to one. Linear Algebra and its Applications, 12, 185--188","author":"Nicholson V. A.","year":"1975","unstructured":"Nicholson, V. A. (1975). Matrices with permanent equal to one. Linear Algebra and its Applications, 12, 185--188."},{"key":"e_1_3_2_1_8_1","volume-title":"Conf. on Emp. Methods in Nat. Lang. Process. - Comp. Nat. Lang. Learn. (pp. 132--140)","author":"Smith D. A.","year":"2007","unstructured":"Smith, D. A., & Smith, N. A. (2007). Probabilistic models of nonprojective dependency trees. Conf. on Emp. Methods in Nat. Lang. Process. - Comp. Nat. Lang. Learn. (pp. 132--140)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070103"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015345"}],"event":{"name":"ICML '09: The 26th Annual International Conference on Machine Learning held in conjunction with the 2007 International Conference on Inductive Logic Programming","location":"Montreal Quebec Canada","acronym":"ICML '09","sponsor":["MITACS","Microsoft Research Microsoft Research","NSF"]},"container-title":["Proceedings of the 26th Annual International Conference on Machine Learning"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1553374.1553430","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1553374.1553430","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T19:52:21Z","timestamp":1779047541000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1553374.1553430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,14]]},"references-count":11,"alternative-id":["10.1145\/1553374.1553430","10.1145\/1553374"],"URL":"https:\/\/doi.org\/10.1145\/1553374.1553430","relation":{},"subject":[],"published":{"date-parts":[[2009,6,14]]},"assertion":[{"value":"2009-06-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}