M. Amin Khajehnejad

According to our database1, M. Amin Khajehnejad authored at least 30 papers between 2009 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
How did Donald Trump Surprisingly Win the 2016 United States Presidential Election? an Information-Theoretic Perspective (Clean Sensing for Big Data Analytics: Optimal Strategies, Estimation Error Bounds Tighter than the Cramér-Rao Bound).
CoRR, 2018

2015
Improving the Thresholds of Sparse Recovery: An Analysis of a Two-Step Reweighted Basis Pursuit Algorithm.
IEEE Trans. Inf. Theory, 2015

2012
Divide-and-Conquer: Approaching the Capacity of the Two-Pair Bidirectional Gaussian Relay Network.
IEEE Trans. Inf. Theory, 2012

Reweighted LP Decoding for LDPC Codes.
IEEE Trans. Inf. Theory, 2012

Recovery threshold for optimal weight ℓ1 minimization.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

An analog sub-linear time sparse signal acquisition framework based on structured matrices.
Proceedings of the 2012 IEEE International Conference on Acoustics, 2012

Projected ℓ1-minimization for compressed sensing.
Proceedings of the 2012 IEEE International Conference on Acoustics, 2012

2011
Analyzing Weighted <sub>1</sub> Minimization for Sparse Recovery With Nonuniform Sparse Models.
IEEE Trans. Signal Process., 2011

Sparse Recovery of Nonnegative Signals With Minimal Expansion.
IEEE Trans. Signal Process., 2011

Linear precoding in MIMO broadcast channel with arbitrary rank constraints.
Proceedings of the 9th International Symposium on Modeling and Optimization in Mobile, 2011

Adaptive beamforming algorithms for wireless link layer multicasting.
Proceedings of the IEEE 22nd International Symposium on Personal, 2011

Subspace expanders and matrix rank minimization.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Summary based structures with improved sublinear recovery for compressed sensing.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Explicit matrices for sparse approximation.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Improved thresholds for rank minimization.
Proceedings of the IEEE International Conference on Acoustics, 2011

Weighted compressed sensing and rank minimization.
Proceedings of the IEEE International Conference on Acoustics, 2011

Compressed Network Tomography for Probabilistic Tree Mixture Models.
Proceedings of the Global Communications Conference, 2011

2010
Analyzing Weighted ℓ<sub>1</sub> Minimization for Sparse Recovery with Nonuniform Sparse Models
CoRR, 2010

Improved Sparse Recovery Thresholds with Two-Step Reweighted ℓ<sub>1</sub> Minimization
CoRR, 2010

Improved sparse recovery thresholds with two-step reweighted ℓ1 minimization.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Breaking through the thresholds: an analysis for iterative reweighted <i>l</i>1 minimization via the Grassmann angle framework.
Proceedings of the IEEE International Conference on Acoustics, 2010

Reweighted LP decoding for LDPC codes.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009
Breaking through the Thresholds: an Analysis for Iterative Reweighted ℓ<sub>1</sub> Minimization via the Grassmann Angle Framework
CoRR, 2009

Sparse Recovery of Positive Signals with Minimal Expansion
CoRR, 2009

Weighted ℓ<sub>1</sub> Minimization for Sparse Recovery with Prior Information
CoRR, 2009

Capacity region of the deterministic multi-pair bi-directional relay network.
Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Weighted ℓ1 minimization for sparse recovery with prior information.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Approximate capacity region of the two-pair bidirectional Gaussian relay network.
Proceedings of the IEEE International Symposium on Information Theory, 2009

On the recovery of nonnegative sparse vectors from sparse measurements inspired by expanders.
Proceedings of the IEEE International Conference on Acoustics, 2009

Breaking the ℓ1 recovery thresholds with reweighted ℓ1 optimization.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009


  Loading...