Cargando…
Communication Efficient Algorithms for Bounding and Approximating the Empirical Entropy in Distributed Systems
The empirical entropy is a key statistical measure of data frequency vectors, enabling one to estimate how diverse the data are. From the computational point of view, it is important to quickly compute, approximate, or bound the entropy. In a distributed system, the representative (“global”) frequen...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
MDPI
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9689552/ https://www.ncbi.nlm.nih.gov/pubmed/36359705 http://dx.doi.org/10.3390/e24111611 |