Finding Longest Increasing and Common Subsequences in Streaming Data
| dc.contributor.author | Liben-Nowell, David | |
| dc.contributor.author | Vee, Erik | |
| dc.contributor.author | Zhu, An | |
| dc.date.accessioned | 2005-12-22T01:15:02Z | |
| dc.date.available | 2005-12-22T01:15:02Z | |
| dc.date.issued | 2003-11-26 | |
| dc.identifier.other | MIT-CSAIL-TR-2003-030 | |
| dc.identifier.other | MIT-LCS-TR-931 | |
| dc.identifier.uri | http://hdl.handle.net/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.format.mimetype | application/postscript | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.relation.ispartofseries | Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory | |
| dc.title | Finding Longest Increasing and Common Subsequences in Streaming Data |
