A time optimized scheme for top-\( k\) list maintenance over incomplete data streams (Q1749630)
From MaRDI portal
!
WARNING
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 6869515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A time optimized scheme for top-\( k\) list maintenance over incomplete data streams |
scientific article; zbMATH DE number 6869515 |
Statements
A time optimized scheme for top-\( k\) list maintenance over incomplete data streams (English)
0 references
17 May 2018
0 references
data streams
0 references
top-\( k\) list
0 references
top-\( k\) list maintenance
0 references
optimal stopping theory
0 references
0.7751432061195374
0 references
0.7124497890472412
0 references
0.6743615865707397
0 references
0.6571059226989746
0 references
0.6531335115432739
0 references
