Cargando…
DDR-coin: An Efficient Probabilistic Distributed Trigger Counting Algorithm
A distributed trigger counting (DTC) problem is to detect w triggers in the distributed system consisting of n nodes. DTC algorithms can be used for monitoring systems using sensors to detect a significant global change. When designing an efficient DTC algorithm, the following goals should be consid...
Autores principales: | Kim, Seokhyun, Park, Yongsu |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7696785/ https://www.ncbi.nlm.nih.gov/pubmed/33187349 http://dx.doi.org/10.3390/s20226446 |
Ejemplares similares
-
MarkerCount: A stable, count-based cell type identifier for single-cell RNA-seq experiments
por: Kim, HanByeol, et al.
Publicado: (2022) -
Shortest path counting in probabilistic biological networks
por: Ren, Yuanfang, et al.
Publicado: (2018) -
Discoidin Domain Receptors, DDR1b and DDR2, Promote Tumour Growth within Collagen but DDR1b Suppresses Experimental Lung Metastasis in HT1080 Xenografts
por: Wasinski, Benjamin, et al.
Publicado: (2020) -
An efficient and accurate distributed learning algorithm for modeling multi-site zero-inflated count outcomes
por: Edmondson, Mackenzie J., et al.
Publicado: (2021) -
BMI1, ATM and DDR
por: Lin, Xiaozeng, et al.
Publicado: (2015)