scientific article; zbMATH DE number 5763313
From MaRDI portal
Publication:3576759
zbMATH Open1192.68959MaRDI QIDQ3576759FDOQ3576759
Authors:
Publication date: 2 August 2010
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAH0110/0.html
Title of this publication is not available (Why is that?)
Recommendations
- LogLog counting of large cardinalities (extended abstract)
- An optimal cardinality estimation algorithm based on order statistics and its full analysis
- Efficient estimation of the cardinality of large data sets
- scientific article; zbMATH DE number 4099072
- Logspace optimization problems and their approximability properties
- Fundamentals of Computation Theory
- Parameterised counting in logspace
- A super-logarithmic lower bound for hypercubic sorting networks
- Modular, higher-order cardinality analysis in theory and practice
- Cardinality estimation in numeric on-line databases
Cited In (26)
- Distinct counting with a self-learning bitmap
- Efficient exact algorithm for count distinct problem
- On distributed cardinality estimation: random arcs recycled
- Approximating the size of a radio network in beeping model
- Improving MinHash via the containment index with applications to metagenomic analysis
- Binary vectors for fast distance and similarity estimation
- A survey of challenges for runtime verification from advanced application domains (beyond software)
- A statistical analysis of probabilistic counting algorithms
- Order statistics and estimating cardinalities of massive data sets
- Index structures for fast similarity search for real-valued vectors. I
- HyperLogLog
- Give me some slack: efficient network measurements
- An analytic approach to the asymptotic variance of trie statistics and related structures
- Index structures for fast similarity search for binary vectors
- A unified scheme for generalizing cardinality estimators to sum aggregation
- Order statistics and estimating cardinalities of massive data sets
- Fast size approximation of a radio network in beeping model
- Optimizing the confidence bound of count-min sketches to estimate the streaming big data query results more precisely
- LogLog counting of large cardinalities (extended abstract)
- Spiking neural networks through the lens of streaming algorithms
- Measuring the impact of MVC attack in large complex networks
- An optimal cardinality estimation algorithm based on order statistics and its full analysis
- Sample complexity of the distinct elements problem
- I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs
- Approximate set union via approximate randomization
- Approximate set union via approximate randomization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576759)
