{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:32Z","timestamp":1750307912592,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T00:00:00Z","timestamp":1182297600000},"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":[[2007,6,20]]},"DOI":"10.1145\/1273496.1273529","type":"proceedings-article","created":{"date-parts":[[2008,10,7]],"date-time":"2008-10-07T13:06:52Z","timestamp":1223384812000},"page":"257-264","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["CarpeDiem"],"prefix":"10.1145","author":[{"given":"Roberto","family":"Esposito","sequence":"first","affiliation":[{"name":"Universit\u00e0 di Torino, Torino, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele P.","family":"Radicioni","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Torino, Torino, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.3115\/116580.116608"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.3115\/1118693.1118694"},{"key":"e_1_3_2_1_3_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"1990","unstructured":"Cormen , T. H. , Leiserson , C. , & Rivest , R. L. ( 1990 ). Introduction to Algorithms . Cambridge, MASS : MIT Press . Cormen, T. H., Leiserson, C., & Rivest, R. L. (1990). Introduction to Algorithms. Cambridge, MASS: MIT Press."},{"key":"e_1_3_2_1_4_1","volume-title":"Machine Learning for Sequential Data: A Review. Structural, Syntactic, and Statistical Pattern Recognition (pp. 15--30)","author":"Dietterich T.","year":"2002","unstructured":"Dietterich , T. ( 2002 ). Machine Learning for Sequential Data: A Review. Structural, Syntactic, and Statistical Pattern Recognition (pp. 15--30) . Springer-Verlag . Dietterich, T. (2002). Machine Learning for Sequential Data: A Review. Structural, Syntactic, and Statistical Pattern Recognition (pp. 15--30). Springer-Verlag."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057827"},{"key":"e_1_3_2_1_6_1","volume-title":"Fast Algorithms for Large-State-Space HMMs with Applications to Web Usage Analysis. Advances in Neural Information Processing System","author":"Felzenszwalb P. F.","year":"2003","unstructured":"Felzenszwalb , P. F. , Huttenlocher , D. P. , & Kleinberg , J. M. ( 2003 ). Fast Algorithms for Large-State-Space HMMs with Applications to Web Usage Analysis. Advances in Neural Information Processing System . Felzenszwalb, P. F., Huttenlocher, D. P., & Kleinberg, J. M. (2003). Fast Algorithms for Large-State-Space HMMs with Applications to Web Usage Analysis. Advances in Neural Information Processing System."},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. of the Eighteenth International Conference on Machine Learning (pp. 282--289)","author":"Lafferty J.","year":"2001","unstructured":"Lafferty , J. , & Pereira , F. ( 2001 ). Conditional random fields: Probabilistic models for segmenting and labeling sequence data . Proc. of the Eighteenth International Conference on Machine Learning (pp. 282--289) . San Francisco, CA: Morgan Kaufmann. Lafferty, J., & Pereira, F. (2001). Conditional random fields: Probabilistic models for segmenting and labeling sequence data. Proc. of the Eighteenth International Conference on Machine Learning (pp. 282--289). San Francisco, CA: Morgan Kaufmann."},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. 17th International Conf. on Machine Learning (pp. 591--598)","author":"McCallum A.","year":"2000","unstructured":"McCallum , A. , Freitag , D. , & Pereira , F. ( 2000 ). Maximum entropy Markov models for information extraction and segmentation . Proc. 17th International Conf. on Machine Learning (pp. 591--598) . Morgan Kaufmann, San Francisco, CA. McCallum, A., Freitag, D., & Pereira, F. (2000). Maximum entropy Markov models for information extraction and segmentation. Proc. 17th International Conf. on Machine Learning (pp. 591--598). Morgan Kaufmann, San Francisco, CA."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1162\/014892602760137167"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/108235.108253"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11875604_72"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102452"},{"key":"e_1_3_2_1_13_1","first-page":"260","volume-title":"Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm","author":"Viterbi A. J.","year":"1967","unstructured":"Viterbi , A. J. ( 1967 ). Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm . IEEE T. Inform. Theory ( pp. 260 -- 269 ). Viterbi, A. J. (1967). Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm. IEEE T. Inform. Theory (pp. 260--269)."}],"event":{"name":"ICML '07 & ILP '07: The 24th Annual International Conference on Machine Learning held in conjunction with the 2007 International Conference on Inductive Logic Programming","sponsor":["Machine Learning Journal"],"location":"Corvalis Oregon USA","acronym":"ICML '07 & ILP '07"},"container-title":["Proceedings of the 24th international conference on Machine learning"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273496.1273529","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1273496.1273529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:53Z","timestamp":1750258073000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273496.1273529"}},"subtitle":["an algorithm for the fast evaluation of SSL classifiers"],"short-title":[],"issued":{"date-parts":[[2007,6,20]]},"references-count":13,"alternative-id":["10.1145\/1273496.1273529","10.1145\/1273496"],"URL":"https:\/\/doi.org\/10.1145\/1273496.1273529","relation":{},"subject":[],"published":{"date-parts":[[2007,6,20]]},"assertion":[{"value":"2007-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}