3 papers
cs.SI2019
Compressive Closeness in Networks
Hamidreza Mahyar, Rouzbeh Hasheminezhad, H Eugene Stanley
Distributed algorithms for network science applications are of great importance due to today's large real-world networks. In such algorithms, a node is allowed only to have local i…
cs.IT2016
Convex block-sparse linear regression with expanders -- provably
Anastasios Kyrillidis, Bubacarr Bah, Rouzbeh Hasheminezhad +3
Sparse matrices are favorable objects in machine learning and optimization. When such matrices are used, in place of dense ones, the overall complexity requirements in optimization…
cs.LO2015
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs
Krishnendu Chatterjee, Hongfei Fu, Petr Novotny +1
In this paper, we consider termination of probabilistic programs with real-valued variables. The questions concerned are: 1. qualitative ones that ask (i) whether the program termi…