Zobrazeno 1 - 10
of 93
pro vyhledávání: '"Deshpande, Yash"'
Autor:
Deshpande, Yash, Diederich, Philip, Luthfi, Muhamad, Becker, Laura, Fontalvo-Hernández, José, Kellerer, Wolfgang
The rising prevalence of real-time applications that require deterministic communication over mobile networks necessitates the joint operation of both mobile and fixed network components. This joint operation requires designing components that intera
Externí odkaz:
http://arxiv.org/abs/2409.13400
The demands on networks are increasing at a fast pace. In particular, real-time applications have very strict network requirements. However, building a network that hosts real-time applications is a cost-intensive endeavor, especially for experimenta
Externí odkaz:
http://arxiv.org/abs/2408.10171
The proliferation of 5G technology necessitates advanced network management strategies to ensure optimal performance and reliability. Digital Twins (DTs) have emerged as a promising paradigm for modeling and simulating complex systems like the 5G Rad
Externí odkaz:
http://arxiv.org/abs/2407.13340
This paper presents OpenAirLink(OAL), an open-source channel emulator for reproducible testing of wireless scenarios. OAL is implemented on off-the-shelf software-defined radios (SDR) and presents a smaller-scale alternative to expensive commercially
Externí odkaz:
http://arxiv.org/abs/2404.09660
Industry 4.0 has brought to attention the need for a connected, flexible, and autonomous production environment. The New Radio (NR)-sidelink, which was introduced by the third-generation partnership project (3GPP) in Release 16, can be particularly h
Externí odkaz:
http://arxiv.org/abs/2309.02949
In this paper, we propose Advanced Tree-algorithm with Interference Cancellation (ATIC), a variant of binary tree-algorithm with successive interference cancellation (SICTA) introduced by Yu and Giannakis. ATIC assumes that Interference Cancellation
Externí odkaz:
http://arxiv.org/abs/2308.15158
In this article, we calculate the mean throughput, number of collisions, successes, and idle slots for random tree algorithms with successive interference cancellation. Except for the case of the throughput for the binary tree, all the results are ne
Externí odkaz:
http://arxiv.org/abs/2302.08145
In this paper, we outline the approach for the derivation of the length of the collision resolution interval for d-ary tree algorithms (TA) with gated access and successive interference cancellation (SIC), conditioned on the number of the contending
Externí odkaz:
http://arxiv.org/abs/2208.04066
Autor:
Huang, Ningyuan, Deshpande, Yash R., Liu, Yibo, Alberts, Houda, Cho, Kyunghyun, Vania, Clara, Calixto, Iacer
We propose a method to make natural language understanding models more parameter efficient by storing knowledge in an external knowledge graph (KG) and retrieving from this KG using a dense index. Given (possibly multilingual) downstream task data, e
Externí odkaz:
http://arxiv.org/abs/2206.13163
Bayesian models of group learning are studied in Economics since the 1970s. and more recently in computational linguistics. The models from Economics postulate that agents maximize utility in their communication and actions. The Economics models do n
Externí odkaz:
http://arxiv.org/abs/2205.11561