{"id":"https://openalex.org/W2139034093","doi":"https://doi.org/10.1145/1143844.1143927","title":"Online decoding of Markov models under latency constraints","display_name":"Online decoding of Markov models under latency constraints","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2139034093","doi":"https://doi.org/10.1145/1143844.1143927","mag":"2139034093"},"language":"en","primary_location":{"id":"doi:10.1145/1143844.1143927","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143844.1143927","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd international conference on Machine learning  - ICML '06","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001944148","display_name":"Mukund Narasimhan","orcid":"https://orcid.org/0009-0003-6489-105X"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mukund Narasimhan","raw_affiliation_strings":["Microsoft Corporation, One Microsoft Way, Redmond WA","Microsoft Corporation (One Microsoft Way, Redmond, WA)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Corporation, One Microsoft Way, Redmond WA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Corporation (One Microsoft Way, Redmond, WA)","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042310818","display_name":"Paul Viola","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul Viola","raw_affiliation_strings":["Microsoft Corporation, One Microsoft Way, Redmond WA","Microsoft Corporation (One Microsoft Way, Redmond, WA)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Corporation, One Microsoft Way, Redmond WA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Corporation (One Microsoft Way, Redmond, WA)","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083137668","display_name":"Michael Shilman","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Shilman","raw_affiliation_strings":["Microsoft Corporation, One Microsoft Way, Redmond WA","Microsoft Corporation (One Microsoft Way, Redmond, WA)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Corporation, One Microsoft Way, Redmond WA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Corporation (One Microsoft Way, Redmond, WA)","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":0.9324,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.81927864,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"657","last_page":"664"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10028","display_name":"Topic Modeling","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.814642071723938},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8142185211181641},{"id":"https://openalex.org/keywords/viterbi-decoder","display_name":"Viterbi decoder","score":0.7810267806053162},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.7164831161499023},{"id":"https://openalex.org/keywords/iterative-viterbi-decoding","display_name":"Iterative Viterbi decoding","score":0.6507612466812134},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6104291677474976},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5869222283363342},{"id":"https://openalex.org/keywords/soft-output-viterbi-algorithm","display_name":"Soft output Viterbi algorithm","score":0.5704247951507568},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48086243867874146},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.45037710666656494},{"id":"https://openalex.org/keywords/hidden-markov-model","display_name":"Hidden Markov model","score":0.4403860569000244},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.38867422938346863},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.30942994356155396},{"id":"https://openalex.org/keywords/speech-recognition","display_name":"Speech recognition","score":0.2760133147239685},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.140056312084198},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08561918139457703},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.08066228032112122},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.0765920877456665}],"concepts":[{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.814642071723938},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8142185211181641},{"id":"https://openalex.org/C117379686","wikidata":"https://www.wikidata.org/wiki/Q6996459","display_name":"Viterbi decoder","level":3,"score":0.7810267806053162},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.7164831161499023},{"id":"https://openalex.org/C113638808","wikidata":"https://www.wikidata.org/wiki/Q6094410","display_name":"Iterative Viterbi decoding","level":5,"score":0.6507612466812134},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6104291677474976},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5869222283363342},{"id":"https://openalex.org/C130319729","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Soft output Viterbi algorithm","level":5,"score":0.5704247951507568},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48086243867874146},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.45037710666656494},{"id":"https://openalex.org/C23224414","wikidata":"https://www.wikidata.org/wiki/Q176769","display_name":"Hidden Markov model","level":2,"score":0.4403860569000244},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.38867422938346863},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.30942994356155396},{"id":"https://openalex.org/C28490314","wikidata":"https://www.wikidata.org/wiki/Q189436","display_name":"Speech recognition","level":1,"score":0.2760133147239685},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.140056312084198},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08561918139457703},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.08066228032112122},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0765920877456665},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1143844.1143927","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143844.1143927","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd international conference on Machine learning  - ICML '06","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.144.9264","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.9264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.icml2006.org/icml_documents/camera-ready/083_Online_Decoding_of_M.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W145450961","https://openalex.org/W175193499","https://openalex.org/W1517113043","https://openalex.org/W1529468142","https://openalex.org/W1548935184","https://openalex.org/W1605311381","https://openalex.org/W1934019294","https://openalex.org/W1979960035","https://openalex.org/W2034797903","https://openalex.org/W2096175520","https://openalex.org/W2125838338","https://openalex.org/W2138745909","https://openalex.org/W2147311421","https://openalex.org/W2147880316","https://openalex.org/W2150147654","https://openalex.org/W2160150610","https://openalex.org/W2163844356","https://openalex.org/W2541794668","https://openalex.org/W2962735828"],"related_works":["https://openalex.org/W2123150743","https://openalex.org/W2113523782","https://openalex.org/W1560346101","https://openalex.org/W2079324422","https://openalex.org/W2110283895","https://openalex.org/W2060519140","https://openalex.org/W2170798759","https://openalex.org/W1565918541","https://openalex.org/W2139455701","https://openalex.org/W2159305441"],"abstract_inverted_index":{"The":[0],"Viterbi":[1,34,63],"algorithm":[2],"is":[3,52],"an":[4],"efficient":[5],"and":[6,32,61,192],"optimal":[7],"method":[8],"for":[9,25,104,141],"decoding":[10,86],"linear-chain":[11],"Markov":[12],"Models.":[13],"However,":[14],"the":[15,23,55,83,136,139,142,156,173],"entire":[16],"input":[17,56],"sequence":[18],"must":[19],"be":[20,30,36],"observed":[21],"before":[22],"labels":[24,96],"any":[26],"time":[27,170],"step":[28],"can":[29],"generated,":[31],"therefore":[33],"cannot":[35],"directly":[37],"applied":[38],"to":[39,53,64,70,82,100,110,153,181],"online/interactive/streaming":[40],"scenarios":[41],"without":[42,108],"incurring":[43],"significant":[44],"(possibly":[45],"unbounded)":[46],"latency.":[47,196],"A":[48],"widely":[49],"used":[50],"approach":[51,123,140,157],"break":[54],"stream":[57],"into":[58],"fixed-size":[59],"windows,":[60],"apply":[62],"each":[65],"window.":[66,133],"Larger":[67],"windows":[68,183],"lead":[69],"higher":[71,76],"accuracy,":[72],"but":[73],"result":[74],"in":[75,148,190,195],"latency.We":[77],"propose":[78],"several":[79],"alternative":[80],"algorithms":[81],"fixed-sized":[84],"window":[85,114],"approach.":[87],"These":[88],"approaches":[89],"compute":[90],"a":[91,112,126,131,159,165,187],"certainty":[92],"measure":[93],"on":[94],"predicted":[95],"that":[97],"allows":[98],"us":[99,125],"trade":[101],"off":[102],"latency":[103,167,176],"expected":[105],"accuracy":[106],"dynamically,":[107],"having":[109],"choose":[111],"fixed":[113,132,182],"size":[115],"up":[116],"front.":[117],"Not":[118],"surprisingly,":[119],"this":[120],"more":[121],"principled":[122],"gives":[124],"substantial":[127],"improvement":[128],"over":[129],"choosing":[130],"We":[134],"show":[135],"effectiveness":[137],"of":[138,144,168,177],"task":[143],"spotting":[145],"semi-structured":[146],"information":[147],"large":[149],"documents.":[150],"When":[151,179],"compared":[152,180],"full":[154],"Viterbi,":[155,184],"suffers":[158],"0.1":[160],"percent":[161],"error":[162,191],"degradation":[163],"with":[164],"average":[166],"2.6":[169],"steps":[171],"(versus":[172],"potentially":[174],"infinite":[175],"Viterbi).":[178],"we":[185],"achieve":[186],"40x":[188],"reduction":[189,194],"6x":[193]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}