The following pages link to (Q4828995):
Displayed 14 items.
- Optimal sampling from sliding windows (Q414877) (← links)
- Streaming techniques and data aggregation in networks of tiny artefacts (Q465668) (← links)
- Competitive analysis of maintaining frequent items of a stream (Q476837) (← links)
- CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams (Q506760) (← links)
- How to catch \(L_2\)-heavy-hitters on sliding windows (Q744092) (← links)
- The frequent items problem, under polynomial decay, in the streaming model (Q986537) (← links)
- Recent progress on selected topics in database research. -- A report by nine young Chinese researchers working in the United States. (Q1412120) (← links)
- Fast and accurate mining of correlated heavy hitters (Q1741373) (← links)
- Distributed mining of time-faded heavy hitters (Q2054052) (← links)
- Challenges in benchmarking stream learning algorithms with real-world data (Q2212534) (← links)
- Multivariate network traffic analysis using clustered patterns (Q2218438) (← links)
- Efficient pebbling for list traversal synopses with application to program rollback (Q2373729) (← links)
- Linked-tree: An aggregate query algorithm based on sliding window over data stream (Q3445987) (← links)
- Dynamically computing approximate frequency counts in sliding window over data stream (Q5291160) (← links)