Finding longest increasing and common subsequences in streaming data (Q2498982)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding longest increasing and common subsequences in streaming data |
scientific article; zbMATH DE number 5045206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding longest increasing and common subsequences in streaming data |
scientific article; zbMATH DE number 5045206 |
Statements
Finding longest increasing and common subsequences in streaming data (English)
0 references
14 August 2006
0 references
LIS
0 references
LCS
0 references
Data-streaming model
0 references
Algorithms
0 references
Lower bounds
0 references
0.9989376068115234
0 references
0.8918130993843079
0 references
0.8553532958030701
0 references
0.8366138339042664
0 references
