Probabilistic counting algorithms for data base applications
From MaRDI portal
(Redirected from Publication:1069325)
Recommendations
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- A statistical analysis of probabilistic counting algorithms
- How to count quickly and accurately: a unified analysis of probabilistic counting and other related problems
- scientific article; zbMATH DE number 2019620
- A flexible way of counting large numbers approximately in small registers
Cites work
Cited in
(90)- Approximate set union via approximate randomization
- Approximate set union via approximate randomization
- Efficient aggregation algorithms for probabilistic data
- Incremental delay enumeration: space and time
- Depth First Search in the Semi-streaming Model
- Distinct counting with a self-learning bitmap
- More infinite products: Thue-Morse and the gamma function
- Efficient exact algorithm for count distinct problem
- FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams
- Granular counting of uncertain data
- scientific article; zbMATH DE number 3943070 (Why is no real title available?)
- Prefixes of infinite words and ambiguous context-free languages
- Mellin transforms and asymptotics: Harmonic sums
- Statistical estimation with bounded memory
- Space‐efficient tracking of persistent items in a massive data stream
- A Note on Estimating Hybrid Frequency Moment of Data Streams
- Accurate and precise aggregation counting
- scientific article; zbMATH DE number 1863838 (Why is no real title available?)
- On finding common neighborhoods in massive graphs.
- Approximating the size of a radio network in beeping model
- Transcendental infinite products associated with the \(\pm 1\) Thue-Morse sequence
- A note on compressed sensing and the complexity of matrix multiplication
- Mellin transforms and asymptotics. The mergesort recurrence
- scientific article; zbMATH DE number 62475 (Why is no real title available?)
- scientific article; zbMATH DE number 2019620 (Why is no real title available?)
- Analytical depoissonization and its applications
- Estimating hybrid frequency moments of data streams
- Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity
- Binary vectors for fast distance and similarity estimation
- Counting distinct items over update streams
- Sampling to estimate the number of duplicates in a database
- On adaptive sampling
- Gap-free compositions and gap-free samples of geometric random variables
- A result in order statistics related to probabilistic counting
- Secure and efficient multiparty private set intersection cardinality
- The largest missing value in a sample of geometric random variables
- A statistical analysis of probabilistic counting algorithms
- Estimation of the Density of Datasets with Decision Diagrams
- Hierarchical sampling from sketches: Estimating functions over data streams
- Spatially-decaying aggregation over a network
- Simplified Planar Coresets for Data Streams
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams.
- Approximate counting with a floating-point counter
- Combinatorics of geometrically distributed random variables: Left-to-right maxima
- On approximating matrix norms in data streams
- LiMoSense: live monitoring in dynamic sensor networks
- A general method for estimating correlated aggregates over a data stream
- Philippe Flajolet's early work in combinatorics
- On gaps and unoccupied urns in sequences of geometrically distributed random variables
- How to count quickly and accurately: a unified analysis of probabilistic counting and other related problems
- Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
- On the distribution for the duration of a randomized leader election algorithm
- Streaming techniques and data aggregation in networks of tiny artefacts
- scientific article; zbMATH DE number 6820309 (Why is no real title available?)
- Give me some slack: efficient network measurements
- An analytic approach to the asymptotic variance of trie statistics and related structures
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- A unified scheme for generalizing cardinality estimators to sum aggregation
- Paperfolding infinite products and the gamma function
- Algorithms and Computation
- The visibility parameter for words and permutations
- Probabilistic analysis of adaptative sampling
- Streaming algorithms for multitasking scheduling with shared processing
- A flexible way of counting large numbers approximately in small registers
- The number of distinct values in a geometrically distributed sample
- Two improved range-efficient algorithms for \(F_0\) estimation
- Distinctness of compositions of an integer: A probabilistic analysis
- Occupancy schemes associated to Yule processes
- Model counting meets \(F_0\) estimation
- Distributed data clustering in sensor networks
- Fast size approximation of a radio network in beeping model
- Combinatorics of geometrically distributed random variables: Run statistics
- Continuous monitoring of \(\ell_p\) norms in data streams
- The online space complexity of probabilistic languages
- LogLog counting of large cardinalities (extended abstract)
- Secure and highly-available aggregation queries in large-scale sensor networks via set sampling
- The cost of fault tolerance in multi-party communication complexity
- Measuring the impact of MVC attack in large complex networks
- Efficient estimation of the cardinality of large data sets
- On the number of active nodes in a multicomputer system
- Summary data structures for massive data
- Automata theory on sliding windows
- Thue, combinatorics on words, and conjectures inspired by the Thue-Morse sequence
- A variation of the Newton-Pepys problem and its connections to size-estimation problems
- Accelerate the classification statistics in RFID systems
- The zeta-regularized product of odious numbers
- Analytic analysis of algorithms
- Adversarially robust streaming algorithms via differential privacy
- Efficient sampling strategies for relational database operations
- Aggregate query processing in the presence of duplicates in wireless sensor networks
This page was built for publication: Probabilistic counting algorithms for data base applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069325)
