Finding frequent items over sliding windows with constant update time (Q991773): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.027 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2128785438 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improved data stream summary: the count-min sketch and its applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4411371 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: CR-precis: A Deterministic Summary Structure for Update Data Streams / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding repeated elements / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:40, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding frequent items over sliding windows with constant update time |
scientific article |
Statements
Finding frequent items over sliding windows with constant update time (English)
0 references
7 September 2010
0 references
approximation algorithms
0 references
on-line algorithms
0 references
