Finding Longest Increasing and Common Subsequences in Streaming Data
| dc.date.accessioned | 2005-12-22T01:15:02Z | |
| dc.date.accessioned | 2018-11-24T10:23:58Z | |
| dc.date.available | 2005-12-22T01:15:02Z | |
| dc.date.available | 2018-11-24T10:23:58Z | |
| dc.date.issued | 2003-11-26 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/30435 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/30435 | |
| dc.description.abstract | In 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.extent | 15 p. | |
| dc.format.extent | 19636061 bytes | |
| dc.format.extent | 807700 bytes | |
| dc.language.iso | en_US | |
| dc.title | Finding Longest Increasing and Common Subsequences in Streaming Data |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| MIT-CSAIL-TR-2003-030.pdf | 807.7Kb | application/pdf | View/ |
| MIT-CSAIL-TR-2003-030.ps | 19.63Mb | application/postscript | View/ |