Finding frequent items in data streams (Q1884870): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59831030, #quickstatements; #temporary_batch_1710346988437
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The space complexity of approximating the frequency moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, small-space algorithms for approximate histogram maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space lower bounds for distance approximation in the data stream model / rank
 
Normal rank

Latest revision as of 14:49, 7 June 2024

scientific article
Language Label Description Also known as
English
Finding frequent items in data streams
scientific article

    Statements

    Finding frequent items in data streams (English)
    0 references
    0 references
    27 October 2004
    0 references
    0 references
    Frequent items
    0 references
    Streaming algorithm
    0 references
    Approximation
    0 references
    0 references