Show simple item record

Finding Longest Increasing and Common Subsequences in Streaming Data

dc.date.accessioned2005-12-22T01:15:02Z
dc.date.accessioned2018-11-24T10:23:58Z
dc.date.available2005-12-22T01:15:02Z
dc.date.available2018-11-24T10:23:58Z
dc.date.issued2003-11-26
dc.identifier.urihttp://hdl.handle.net/1721.1/30435
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/30435
dc.description.abstractIn this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence(LIS) and Longest Common Subsequence (LCS) problems in the data streaming model.
dc.format.extent15 p.
dc.format.extent19636061 bytes
dc.format.extent807700 bytes
dc.language.isoen_US
dc.titleFinding Longest Increasing and Common Subsequences in Streaming Data


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2003-030.pdf807.7Kbapplication/pdfView/Open
MIT-CSAIL-TR-2003-030.ps19.63Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record