Spatially-decaying aggregation over a network
From MaRDI portal
Publication:878748
DOI10.1016/J.JCSS.2006.10.016zbMATH Open1115.68016OpenAlexW2126356486MaRDI QIDQ878748FDOQ878748
Authors: Edith Cohen, Haim Kaplan 
Publication date: 26 April 2007
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2006.10.016
Recommendations
Cites Work
- Fibonacci heaps and their uses in improved network optimization algorithms
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Maintaining Stream Statistics over Sliding Windows
- Size-estimation framework with applications to transitive closure and reachability
- A small approximately min-wise independent family of hash functions
- Probabilistic counting algorithms for data base applications
- Min-wise independent permutations
- Title not available (Why is that?)
- Spatial gossip and resource location protocols
- Structure prediction and computation of sparse matrix products
- Maintaining time-decaying stream aggregates
- Efficient estimation algorithms for neighborhood variance and other moments
Cited In (7)
- Title not available (Why is that?)
- Spatial homogenization in a stochastic network with mobility
- Algorithms and estimators for summarization of unaggregated data streams
- Efficient estimation algorithms for neighborhood variance and other moments
- Peer-to-peer aggregation techniques dissected
- Efficient distributed approximation algorithms via probabilistic tree embeddings
- Axioms for Centrality
Uses Software
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)
