Spatially-decaying aggregation over a network
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2019620 (Why is no real title available?)
- A small approximately min-wise independent family of hash functions
- Efficient estimation algorithms for neighborhood variance and other moments
- Fibonacci heaps and their uses in improved network optimization algorithms
- Maintaining Stream Statistics over Sliding Windows
- Maintaining time-decaying stream aggregates
- Min-wise independent permutations
- Probabilistic counting algorithms for data base applications
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Size-estimation framework with applications to transitive closure and reachability
- Spatial gossip and resource location protocols
- Structure prediction and computation of sparse matrix products
Cited in
(7)- scientific article; zbMATH DE number 1950679 (Why is no real title available?)
- Efficient distributed approximation algorithms via probabilistic tree embeddings
- Axioms for Centrality
- Algorithms and estimators for summarization of unaggregated data streams
- Efficient estimation algorithms for neighborhood variance and other moments
- Spatial homogenization in a stochastic network with mobility
- Peer-to-peer aggregation techniques dissected
This page was built for publication: Spatially-decaying aggregation over a network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878748)