Finding Longest Increasing and Common Subsequences in Streaming Data
Citable URI:
http://hdl.handle.net/1721.1/30435
| Title: | Finding Longest Increasing and Common Subsequences in Streaming Data |
| Author: | Liben-Nowell, David; Vee, Erik; Zhu, An |
| Issue Date: | 2003-11-26 |
| 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. |
| URI: | http://hdl.handle.net/1721.1/30435 |
| Other Identifiers: | MIT-CSAIL-TR-2003-030 MIT-LCS-TR-931 |
| Series/Report no.: | Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory |
Files in this item
| Files | Size | Format | View | |
|---|---|---|---|---|
| MIT-CSAIL-TR-2003-030.ps | 19.63Mb | Postscript |
View/ |
Files in this item
| Files | Size | Format | View | |
|---|---|---|---|---|
| MIT-CSAIL-TR-2003-030.pdf | 807.7Kb |
View/ |
This item appears in the following Collection(s)
All Items in DSpace@MIT are protected by original copyright, with all rights reserved, unless otherwise indicated.
|
|
Contact
MIT Libraries
|