The following pages link to (Q3576759):
Displaying 18 items.
- HyperLogLog (Q14608) (← links)
- A unified scheme for generalizing cardinality estimators to sum aggregation (Q477684) (← links)
- Measuring the impact of MVC attack in large complex networks (Q506775) (← links)
- Index structures for fast similarity search for binary vectors (Q681740) (← links)
- Order statistics and estimating cardinalities of massive data sets (Q1003691) (← links)
- When distributed computation is communication expensive (Q1689746) (← links)
- Sample complexity of the distinct elements problem (Q1737973) (← links)
- Index structures for fast similarity search for real-valued vectors. I (Q1745711) (← links)
- A survey of challenges for runtime verification from advanced application domains (beyond software) (Q2008293) (← links)
- Improving MinHash via the containment index with applications to metagenomic analysis (Q2011091) (← links)
- Give me some slack: efficient network measurements (Q2272404) (← links)
- Fast size approximation of a radio network in beeping model (Q2292914) (← links)
- I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs (Q2293164) (← links)
- Binary vectors for fast distance and similarity estimation (Q2362826) (← links)
- An analytic approach to the asymptotic variance of trie statistics and related structures (Q2437771) (← links)
- Approximating the Size of a Radio Network in Beeping Model (Q2835036) (← links)
- Approximate set union via approximate randomization (Q5918258) (← links)
- Approximate set union via approximate randomization (Q5919116) (← links)