Abstract: We consider two secret key generation problems under a pairwise independent network model, and propose low complexity key generation schemes in a framework that connects our problems to ...

Probabilistic graphical models can efficiently represent the structure ... struggle when the conditional dependency graphs contain loops. Here we use Graph Neural Networks (GNNs) to learn a ...

In the second problem demonstration, we use a similar SI-SNN computing architecture to imitate the ACO (Dorigo and Di Caro, 1999) algorithm and show how it is capable of solving the TSP. Each SNN is a ...