Pages that link to "Item:Q5901623"
From MaRDI portal
The following pages link to LATIN 2004: Theoretical Informatics (Q5901623):
Displaying 18 items.
- How to catch \(L_2\)-heavy-hitters on sliding windows (Q744092) (← links)
- Optimizing the confidence bound of count-min sketches to estimate the streaming big data query results more precisely (Q783053) (← links)
- On-board vehicle data stream monitoring using mine-fleet and fast resource constrained monitoring of correlation matrices (Q857982) (← links)
- Approximate colored range and point enclosure queries (Q1018093) (← links)
- Learned sketches for frequency estimation (Q1999028) (← links)
- Computer science and decision theory (Q2271874) (← links)
- The eternal sunshine of the sketch data structure (Q2377889) (← links)
- Adaptive spatial partitioning for multidimensional data streams (Q2509025) (← links)
- Improved range-summable random variable construction algorithms (Q2921749) (← links)
- Sparse Recovery with Partial Support Knowledge (Q3088079) (← links)
- A Sketch Algorithm for Estimating Two-Way and Multi-Way Associations (Q3225464) (← links)
- Compressive Gaussian Mixture Estimation (Q3460835) (← links)
- CR-precis: A Deterministic Summary Structure for Update Data Streams (Q3611895) (← links)
- Calculating Max and Min with exemplary sketch algorithm in data stream management system (Q3646624) (← links)
- Beating CountSketch for heavy hitters in insertion streams (Q5361876) (← links)
- Time-decaying sketches for sensor data aggregation (Q5401414) (← links)
- Algorithms and Computation (Q5712141) (← links)
- (Q5743471) (← links)