Zobrazeno 1 - 10
of 7 620
pro vyhledávání: '"A Dory"'
In this paper, we present new algorithms for approximating All-Pairs Shortest Paths (APSP) in the Congested Clique model. We present randomized algorithms for weighted undirected graphs. Our first contribution is an $O(1)$-approximate APSP algorithm
Externí odkaz:
http://arxiv.org/abs/2405.02695
We revisit the classic broadcast problem, wherein we have $k$ messages, each composed of $O(\log{n})$ bits, distributed arbitrarily across a network. The objective is to broadcast these messages to all nodes in the network. In the distributed CONGEST
Externí odkaz:
http://arxiv.org/abs/2404.12930
Diamond has emerged as a leading host material for solid-state quantum emitters, quantum memories, and quantum sensors. However, the challenges in fabricating photonic devices in diamond have limited its potential for use in quantum technologies. Whi
Externí odkaz:
http://arxiv.org/abs/2307.13309
Autor:
Dory, Michal, Forster, Sebastian, Kirkpatrick, Yael, Nazari, Yasamin, Williams, Virginia Vassilevska, de Vos, Tijn
In this paper, we revisit the classic approximate All-Pairs Shortest Paths (APSP) problem in undirected graphs. For unweighted graphs, we provide an algorithm for $2$-approximate APSP in $\tilde O(n^{2.5-r}+n^{\omega(r)})$ time, for any $r\in[0,1]$.
Externí odkaz:
http://arxiv.org/abs/2307.09258
Autor:
Makai, Attila Lajos, Dőry, Tibor
The exploration of entrepreneurship has become a priority for scientific research in recent years. Understanding this phenomenon is particularly important for the transformation of entrepreneurship into action, which is a key factor in early-stage en
Externí odkaz:
http://arxiv.org/abs/2306.09678
Publikováno v:
Patient Safety, Vol 6, Iss 1 (2024)
# Background Incorrect administration of blood products is a critical concern, occurring once in every 12,000 units transfused in the United States. Blood product documentation and scanning are vital for patient safety, yet difficulties in scanning
Externí odkaz:
https://doaj.org/article/f3b01c2cc82f4ce68e85ddccd9b03d73
A Nearly Time-Optimal Distributed Approximation of Minimum Cost $k$-Edge-Connected Spanning Subgraph
Autor:
Dory, Michal, Ghaffari, Mohsen
The minimum-cost $k$-edge-connected spanning subgraph ($k$-ECSS) problem is a generalization and strengthening of the well-studied minimum-cost spanning tree (MST) problem. While the round complexity of distributedly computing the latter has been wel
Externí odkaz:
http://arxiv.org/abs/2211.04994
We provide new tradeoffs between approximation and running time for the decremental all-pairs shortest paths (APSP) problem. For undirected graphs with $m$ edges and $n$ nodes undergoing edge deletions, we provide four new approximate decremental APS
Externí odkaz:
http://arxiv.org/abs/2211.01152
We describe a simple deterministic $O( \varepsilon^{-1} \log \Delta)$ round distributed algorithm for $(2\alpha+1)(1 + \varepsilon)$ approximation of minimum weighted dominating set on graphs with arboricity at most $\alpha$. Here $\Delta$ denotes th
Externí odkaz:
http://arxiv.org/abs/2206.05174
Publikováno v:
La Revista Icono 14, Vol 22, Iss 1 (2024)
El rechazo al inmigrante se construye socialmente y se alimenta con la viralización de informaciones falseadas, provocando discursos de odio cargados de simbolismos. De ahí que este estudio aborde un análisis semiótico del discurso del odio en lo
Externí odkaz:
https://doaj.org/article/97c6efc5ebce45a683b235de9e33e220