Search Results for author:
Found 3 papers, 1 papers with code
Compressive Closeness in Networks
In such algorithms, a node is allowed only to have local interactions with its immediate neighbors.
Convex block-sparse linear regression with expanders -- provably
Our experimental findings on synthetic and real applications support our claims for faster recovery in the convex setting -- as opposed to using dense sensing matrices, while showing a competitive recovery performance.
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs
Firstly, we show that the membership problem of LRAPP (i) can be decided in polynomial time for APP's with at most demonic non-determinism, and (ii) is NP-hard and in PSPACE for APP's with angelic non-determinism; moreover, the NP-hardness result holds already for APP's without probability and demonic non-determinism.
Logic in Computer Science Programming Languages D.2.4
