Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Leonid Barenboim"'
Publikováno v:
Sensors, Vol 24, Iss 6, p 1977 (2024)
The emergence of autonomous vehicles (AVs) marks a transformative leap in transportation technology. Central to the success of AVs is ensuring user safety, but this endeavor is accompanied by the challenge of establishing trust and acceptance of this
Externí odkaz:
https://doaj.org/article/1e497fec53fa45d6ab2493c5df65f474
Publikováno v:
Future Internet, Vol 11, Iss 3, p 75 (2019)
The software defined networking (SDN) paradigm separates the control plane from the data plane, where an SDN controller receives requests from its connected switches and manages the operation of the switches under its control. Reassignments between s
Externí odkaz:
https://doaj.org/article/b67420184e8e43a1b5c7e0bbc0edd500
Autor:
Leonid Barenboim, Gal Oren
Publikováno v:
Distributed Computing. 35:455-473
Publikováno v:
Journal of the ACM. 69:1-26
We consider graph coloring and related problems in the distributed message-passing model. Locally-iterative algorithms are especially important in this setting. These are algorithms in which each vertex decides about its next color only as a function
Publikováno v:
Proceedings of the 23rd International Conference on Distributed Computing and Networking.
Autor:
Gal Oren, Leonid Barenboim
Publikováno v:
ICDCS Workshops
Sensor nodes are inherently a cheap piece of hardware – due to the common need to use many of them over a large area – and usually contain a small amount of RAM and flash memory, which are insufficient in case of high degree of data sampling. An
Autor:
Tzalik Maimon, Leonid Barenboim
Publikováno v:
ACM Journal of Experimental Algorithmics. 24:1-24
We study dynamic graphs in the fully dynamic centralized setting. In this setting, the vertex set of size n of a graph G is fixed, and the edge set changes step-by-step, such that each step either adds or removes an edge. Dynamic graphs have various
Autor:
Gal Oren, Leonid Barenboim
Publikováno v:
ICDCN (Adjunct Volume)
The Backup Placement problem in networks in the distributed setting considers a network graph G = (V, E), in which the goal of each vertex v ∈ V is selecting a neighbor, such that the maximum number of vertices in V that select the same vertex is m
Autor:
Tzali Maimon, Leonid Barenboim
Publikováno v:
ICDCN
We consider the distributed message-passing model and the Local Computational Algorithms (LCA) model. In both models a network is represented by an n-vertex graph G = (V, E). We focus on labeling problems, such as vertex-coloring, edge-coloring, maxi
Autor:
Leonid Barenboim, Harel Levin
We study algorithms in the distributed message-passing model that produce secured output, for an input graph G. Specifically, each vertex computes its part in the output, the entire output is correct, but each vertex cannot discover the output of oth
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c24056dd0c01d17f59524a25c81fd20c