The following pages link to Database Theory - ICDT 2005 (Q5316609):
Displaying 17 items.
- Mining frequent itemsets over distributed data streams by continuously maintaining a global synopsis (Q408650) (← links)
- Adaptively learning probabilistic deterministic automata from data streams (Q479463) (← links)
- How to catch \(L_2\)-heavy-hitters on sliding windows (Q744092) (← links)
- Measuring evolving data streams' behavior through their intrinsic dimension (Q857985) (← links)
- An evaluation study of clustering algorithms in the scope of user communities assessment (Q979865) (← links)
- Memory-adaptive high utility sequential pattern mining over data streams (Q1699624) (← links)
- A general framework for never-ending learning from time series streams (Q1715913) (← links)
- A time optimized scheme for top-\( k\) list maintenance over incomplete data streams (Q1749630) (← links)
- Top-\(k\) frequent items and item frequency tracking over sliding windows of any size (Q2201636) (← links)
- Simple, Robust and Optimal Ranking from Pairwise Comparisons (Q4558526) (← links)
- Space‐efficient tracking of persistent items in a massive data stream (Q4969927) (← links)
- Deterministic Heavy Hitters with Sublinear Query Time (Q5009510) (← links)
- A Space-Optimal Grammar Compression. (Q5111756) (← links)
- Memory-Efficient Structured Convex Optimization via Extreme Point Sampling (Q5154636) (← links)
- Summary Data Structures for Massive Data (Q5326361) (← links)
- (Q6065457) (← links)
- Randomized counter-based algorithms for frequency estimation over data streams in \(O(\log \log N)\) space (Q6140352) (← links)
