Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Erez Kantor"'
Publikováno v:
Theoretical Computer Science. :53-66
This paper concerns the behavior of an SINR diagram of wireless systems, composed of a set S of n stations embedded in R d , when restricted to the corresponding Voronoi diagram imposed on S. The diagram obtained by restricting the SINR zones to thei
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::725ab4d195e55f9f1c82f245a6baa5d5
https://doi.org/10.1016/j.tcs.2021.04.018
https://doi.org/10.1016/j.tcs.2021.04.018
Publikováno v:
Theoretical Computer Science. 711:105-108
This note considers a 1-dimensional wireless network consisting of a set of n stations located on a line, in the SINR model, which compares the received power of a signal at a receiver against the sum of strengths of other interfering signals plus ba
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e79eece17cd12ce3fce1263baa3a3c0
https://doi.org/10.1016/j.tcs.2017.10.002
https://doi.org/10.1016/j.tcs.2017.10.002
Publikováno v:
SIAM Journal on Discrete Mathematics. 32:1903-1921
The dynamic content distribution problem addresses the trade-off between storage and delivery costs in modern virtual content delivery networks (CDNs). That is, a video file can be stored in multip...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::95cca852a87517287741efbf2bb4616d
https://doi.org/10.1137/16m1103014
https://doi.org/10.1137/16m1103014
Autor:
Erez Kantor, David Peleg
Publikováno v:
Discrete Applied Mathematics. 202:79-94
The paper concerns time-efficient k -shot broadcasting in undirected radio networks for n -node graphs of diameter D . In a k -shot broadcasting algorithm, each node in the network is allowed to transmit at most k times. Both known and unknown topolo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::50e5a383c3dd2bd42e4d48cc7627d3c2
https://doi.org/10.1016/j.dam.2015.08.021
https://doi.org/10.1016/j.dam.2015.08.021
Publikováno v:
Allerton Conference
Networks-on-Chip (NoCs) form an emerging paradigm for communications within chips. In particular, bufferless NoCs require significantly less area and power consumption, but also pose novel major scheduling problems to achieve full capacity. In this p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::156bec5d4942908fd1a474c35be559d6
https://doi.org/10.1109/tpds.2014.2310226
https://doi.org/10.1109/tpds.2014.2310226
Autor:
Michael Borokhovich, Yoram Haddad, Chen Avin, Zvi Lotker, David Peleg, Merav Parter, Erez Kantor
Publikováno v:
Information Processing Letters. 114:728-733
The Perron-Frobenius (PF) theorem provides a simple characterization of the eigenvectors and eigenvalues of irreducible nonnegative square matrices. A generalization of the PF theorem to nonsquare matrices, which can be interpreted as representing sy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76c854d3cd0d18304dce49098bfaeaff
https://doi.org/10.1016/j.ipl.2014.05.004
https://doi.org/10.1016/j.ipl.2014.05.004
In this paper, we investigate offline and online algorithms for rufpp, the problem of minimizing the number of rounds required to schedule a set of unsplittable flows of non-uniform sizes on a given path with non-uniform edge capacities. rufpp is NP-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::91e0c6322d963e30bb0e6dddb843b6df
Autor:
Muriel Medard, Kishori M. Konwar, Nancy Lynch, Alexander A. Schwarzmann, N. Prakash, Erez Kantor
Publikováno v:
IPDPS
Augusta University-Pure
MIT Web Domain
Augusta University-Pure
MIT Web Domain
Erasure codes are increasingly being studied in the context of implementing atomic memory objects in large scale asynchronous distributed storage systems. When compared with the traditional replication based schemes, erasure codes have the potential
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b13e63b532a84698508338dda5fafa3
https://doi.org/10.1109/ipdps.2016.55
https://doi.org/10.1109/ipdps.2016.55
Publikováno v:
SPAA
Many modern datacenter applications involve large-scale computations composed of multiple data flows that need to be completed over a shared set of distributed resources. Such a computation completes when all of its flows complete. A useful abstracti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::26592feedadfb2ad9a8b374da3022ea2
Publikováno v:
Journal of the ACM. 59:1-34
The rules governing the availability and quality of connections in a wireless network are described by physical models such as the signal-to-interference & noise ratio (SINR) model. For a collection of simultaneously transmitting stations in the plan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::097e757838d3ca7faa32e4c5b71611d0
https://doi.org/10.1145/2339123.2339125
https://doi.org/10.1145/2339123.2339125