scientific article; zbMATH DE number 2119721
From MaRDI portal
Publication:4828995
zbMath1093.68673MaRDI QIDQ4828995
Aristides Gionis, Mayur Datar, Rajeev Motwani, Piotr Indyk
Publication date: 29 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (14)
Linked-tree: An aggregate query algorithm based on sliding window over data stream ⋮ Dynamically computing approximate frequency counts in sliding window over data stream ⋮ Efficient pebbling for list traversal synopses with application to program rollback ⋮ Optimal sampling from sliding windows ⋮ Recent progress on selected topics in database research. -- A report by nine young Chinese researchers working in the United States. ⋮ Challenges in benchmarking stream learning algorithms with real-world data ⋮ Multivariate network traffic analysis using clustered patterns ⋮ Streaming techniques and data aggregation in networks of tiny artefacts ⋮ Competitive analysis of maintaining frequent items of a stream ⋮ Fast and accurate mining of correlated heavy hitters ⋮ CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams ⋮ The frequent items problem, under polynomial decay, in the streaming model ⋮ How to catch \(L_2\)-heavy-hitters on sliding windows ⋮ Distributed mining of time-faded heavy hitters
This page was built for publication:
