Zobrazeno 1 - 10
of 6 390
pro vyhledávání: '"Robinson Peter"'
It has been shown that one can design distributed algorithms that are (nearly) singularly optimal, meaning they simultaneously achieve optimal time and message complexity (within polylogarithmic factors), for several fundamental global problems such
Externí odkaz:
http://arxiv.org/abs/2411.07011
Autor:
Caufield, Harry, Kroll, Carlo, O'Neil, Shawn T, Reese, Justin T, Joachimiak, Marcin P, Hegde, Harshad, Harris, Nomi L, Krishnamurthy, Madan, McLaughlin, James A, Smedley, Damian, Haendel, Melissa A, Robinson, Peter N, Mungall, Christopher J
Effective data-driven biomedical discovery requires data curation: a time-consuming process of finding, organizing, distilling, integrating, interpreting, annotating, and validating diverse information into a structured form suitable for databases an
Externí odkaz:
http://arxiv.org/abs/2411.00046
Autor:
Robinson, Peter, Tan, Ming Ming
We study the wake-up problem in distributed networks, where an adversary awakens a subset of nodes at arbitrary times, and the goal is to wake up all other nodes as quickly as possible by sending only few messages. We prove the following lower bounds
Externí odkaz:
http://arxiv.org/abs/2410.09980
We consider the problem of computing a maximal matching with a distributed algorithm in the presence of batch-dynamic changes to the graph topology. We assume that a graph of $n$ nodes is vertex-partitioned among $k$ players that communicate via mess
Externí odkaz:
http://arxiv.org/abs/2401.15550
Publikováno v:
Journal of Theoretical Biology (2017) 428, 132-146
The mechanisms underlying pathologically synchronized neural oscillations in Parkinson's disease (PD) and generalized epilepsies are jointly explored via a neural field model of the corticothalamic-basal ganglia (CTBG) system. The basal ganglia (BG)
Externí odkaz:
http://arxiv.org/abs/2401.13467
We consider the message complexity of verifying whether a given subgraph of the communication network forms a tree with specific properties both in the KT-$\rho$ (nodes know their $\rho$-hop neighborhood, including node IDs) and the KT-$0$ (nodes do
Externí odkaz:
http://arxiv.org/abs/2401.11991
Autor:
Cavalleri, Emanuele, Cabri, Alberto, Soto-Gomez, Mauricio, Bonfitto, Sara, Perlasca, Paolo, Gliozzo, Jessica, Callahan, Tiffany J., Reese, Justin, Robinson, Peter N, Casiraghi, Elena, Valentini, Giorgio, Mesiti, Marco
The "RNA world" represents a novel frontier for the study of fundamental biological processes and human diseases and is paving the way for the development of new drugs tailored to the patient's biomolecular characteristics. Although scientific data a
Externí odkaz:
http://arxiv.org/abs/2312.00183