Zobrazeno 1 - 10
of 90
pro vyhledávání: '"Vaidyanathan, Ramachandran"'
Reliable and efficient estimation of the size of a dynamically changing cluster in an IoT network is critical in its nominal operation. Most previous estimation schemes worked with relatively smaller frame size and large number of rounds. Here we pro
Externí odkaz:
http://arxiv.org/abs/2001.09494
Publikováno v:
In Information and Computation May 2022 285 Part A
In this paper, we consider the problem of partitioning active users in a manner that facilitates multi-access without collision. The setting is of a noisy, synchronous, Boolean, multi-access channel where $K$ active users (out of a total of $N$ users
Externí odkaz:
http://arxiv.org/abs/1505.06452
In this paper, we propose a novel partition reservation system to study the partition information and its transmission over a noise-free Boolean multi-access channel. The objective of transmission is not message restoration, but to partition active u
Externí odkaz:
http://arxiv.org/abs/1404.0425
Publikováno v:
In Computational Geometry: Theory and Applications October 2015 48(9):688-702
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Parallel Computing 2003 29(1):95-109
Publikováno v:
In Topics in Parallel and Distributed Computing 2015:83-116
Autor:
Sharma, Gokarna1 (AUTHOR) sharma@cs.kent.edu, Vaidyanathan, Ramachandran2 (AUTHOR) vaidy@lsu.edu, Trahan, Jerry L.2 (AUTHOR) jtrahan@lsu.edu, Werner, Frank (AUTHOR)
Publikováno v:
Algorithms. Feb2021, Vol. 14 Issue 2, p56-56. 1p.