2 problems

For users indexed by $k$, let $mathcal{N}(k)={i:lVert bm{x}k-bm{x}irVert<r}$ be the neighbor set determined by device locations, and let the GLASSO groups be the neighbor sets…

Low-complexity ML scaling-law conjecture. The low-complexity ML algorithm achieves the same scaling law as the constrained ML scheme, namely successful activity-pattern detection f…