Zobrazeno 1 - 10
of 2 514
pro vyhledávání: '"Doost, A."'
\noindent A perfect dominating set in a graph $G=(V,E)$ is a subset $S \subseteq V$ such that each vertex in $V \setminus S$ has exactly one neighbor in $S$. A perfect coalition in $G$ consists of two disjoint sets of vertices $V_i$ and $V_j$ such th
Externí odkaz:
http://arxiv.org/abs/2409.10185
In cell-free massive MIMO systems with multiple distributed access points (APs) serving multiple users over the same time-frequency resources, downlink beamforming is done through spatial precoding. Precoding vectors can be optimally designed to use
Externí odkaz:
http://arxiv.org/abs/2409.06106
Autor:
An, Qing, Pandey, Divyanshu, Doost-Mohammady, Rahman, Sabharwal, Ashutosh, Shakkottai, Srinivas
An important aspect of 5G networks is the development of Radio Access Network (RAN) slicing, a concept wherein the virtualized infrastructure of wireless networks is subdivided into slices (or enterprises), tailored to fulfill specific use-cases. A k
Externí odkaz:
http://arxiv.org/abs/2407.09706
An injective coloring of a given graph G = (V, E) is a vertex coloring of G such that any two vertices with common neighbor receive distinct colors. An e-injective coloring of a graph G is a vertex coloring of G such that any two vertices with common
Externí odkaz:
http://arxiv.org/abs/2403.02826
\noindent A paired coalition in a graph $G=(V,E)$ consists of two disjoint sets of vertices $V_1$ and $V_2$, neither of which is a paired dominating set but whose union $V_1 \cup V_2$ is a paired dominating set. A paired coalition partition (abbrevia
Externí odkaz:
http://arxiv.org/abs/2402.10842
Autor:
An, Qing, Zafari, Mehdi, Dick, Chris, Segarra, Santiago, Sabharwal, Ashutosh, Doost-Mohammady, Rahman
As wireless communication systems strive to improve spectral efficiency, there has been a growing interest in employing machine learning (ML)-based approaches for adaptive modulation and coding scheme (MCS) selection. In this paper, we introduce a ne
Externí odkaz:
http://arxiv.org/abs/2310.13830
An independent coalition in a graph $G$ consists of two disjoint sets of vertices $V_1$ and $V_2$ neither of which is an independent dominating set but whose union $V_1 \cup V_2$ is an independent dominating set. An independent coalition partition, a
Externí odkaz:
http://arxiv.org/abs/2306.02079
The large number of antennas in massive MIMO systems allows the base station to communicate with multiple users at the same time and frequency resource with multi-user beamforming. However, highly correlated user channels could drastically impede the
Externí odkaz:
http://arxiv.org/abs/2303.00958
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Pp 1-12 (2024)
A paired coalition in a graph [Formula: see text] consists of two disjoint sets of vertices [Formula: see text] and [Formula: see text], neither of which is a paired dominating set but whose union [Formula: see text] is a paired dominating set. A pai
Externí odkaz:
https://doaj.org/article/f9c2197239ab4fae840964ac2c1e17b6
Autor:
Mohammad Saffari Doost, Maria Fernanda Ortega‐Springall, Summer N. Meyer, Nick R. Love, Thomas Konia, Maxwell A. Fung, Maija Kiuru
Publikováno v:
JEADV Clinical Practice, Vol 3, Iss 2, Pp 738-741 (2024)
Externí odkaz:
https://doaj.org/article/a671b6c2c2a24301902d8a84f27c9882