no code implementations • 30 Oct 2021 • Govind Sharma, Aditya Challa, Paarth Gupta, M. Narasimha Murty
In this article, we investigate this problem in the presence of higher-order relations.
no code implementations • 30 Oct 2021 • Govind Sharma, Paarth Gupta, M. Narasihma Murty
The problem of node-similarity in networks has motivated a plethora of such measures between node-pairs, which make use of the underlying graph structure.
1 code implementation • 30 Oct 2021 • Govind Sharma, Swyam Prakash Singh, V. Susheela Devi, M. Narasimha Murty
Usual relations between entities could be captured using graphs; but those of a higher-order -- more so between two different types of entities (which we term "left" and "right") -- calls for a "bipartite hypergraph".
no code implementations • 28 Jan 2021 • Navneet Garg, Avinash Rudraksh, Govind Sharma, Tharmalingam Ratnarajah
Analysis shows that given the nonnegative value of CD, the achieved harvested energy for the proposed precoder is higher than that for perfect IA precoder.
Information Theory Information Theory