Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint (Q1044737)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5650155
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint |
scientific article; zbMATH DE number 5650155 |
Statements
Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint (English)
0 references
18 December 2009
0 references
sequence analysis
0 references
longest segment
0 references
shortest segment
0 references
algorithms
0 references
0 references
0 references
0.8679043650627136
0 references
0.8239054083824158
0 references
