120 citations · 901 across the 72 of their papers we have counts for
7 papers · 2 filters
A robust machine learning method for cell-load approximation in wireless networks
Daniyal Amir Awan, Renato L. G. Cavalcante, Slawomir Stanczak
We propose a learning algorithm for cell-load approximation in wireless networks. The proposed algorithm is robust in the sense that it is designed to cope with the uncertainty ari…
The MAC Resolvability Region, Semantic Security and Its Operational Implications
Matthias Frey, Igor Bjelakovic, Slawomir Stanczak
Building upon previous work on the relation between secrecy and channel resolvability, we revisit a secrecy proof for the multiple-access channel (MAC) from the perspective of reso…
Optimal deep neural networks for sparse recovery via Laplace techniques
Steffen Limmer, Slawomir Stanczak
This paper introduces Laplace techniques for designing a neural network, with the goal of estimating simplex-constraint sparse vectors from compressed measurements. To this end, we…
MAC Resolvability: First And Second Order Results
Matthias Frey, Igor Bjelakovic, Slawomir Stanczak
Building upon previous work on the relation between secrecy and channel resolvability, we revisit a secrecy proof for the multiple-access channel from the perspective of resolvabil…
The role of asymptotic functions in network optimization and feasibility studies
R. L. G. Cavalcante, S. Stanczak
Solutions to network optimization problems have greatly benefited from developments in nonlinear analysis, and, in particular, from developments in convex optimization. A key conce…
User Activity Detection via Group Testing and Coded Computation
Matthias Frey, Igor Bjelaković, Sławomir Stańczak
Inspired by group testing algorithms and the coded computation paradigm, we propose and analyze a novel multiple access scheme for detecting active users in large-scale networks. T…