25 results on '"Andrea Montanari"'
Search Results
2. Asymptotic mutual information for the binary stochastic block model.
3. Information-theoretically optimal sparse PCA.
4. Information-theoretically optimal compressed sensing via spatial coupling and approximate message passing.
5. Subsampling at information theoretically optimal rates.
6. Universality in polytope phase transitions and iterative algorithms.
7. Information theoretic limits on learning stochastic differential equations.
8. Localization from incomplete noisy distance measurements.
9. Compressed Sensing over ℓp-balls: Minimax mean square error.
10. Regularization for matrix completion.
11. The dynamics of message passing on dense graphs, with applications to compressed sensing.
12. On the deletion channel with small deletion probability.
13. An empirical scaling law for polar codes.
14. Matrix completion from a few entries.
15. Smooth compression, Gallager bound and nonlinear sparse-graph codes.
16. The slope scaling parameter for general channels, decoders, and ensembles.
17. Computing the threshold shift for general channels.
18. Asymptotic Rate versus Design Rate.
19. A Generalization of the Finite-Length Scaling Approach Beyond the BEC.
20. Analytic Determination of Scaling Parameters.
21. Maximum a posteriori decoding and turbo codes for general memoryless channels.
22. Weight distributions of LDPC code ensembles: combinatorics meets statistical physics.
23. Further results on finite-length scaling for iteratively decoded LDPC ensembles.
24. Maxwell's construction: the hidden bridge between maximum-likelihood and iterative decoding.
25. Tight bounds for LDPC codes under MAP decoding.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.