暂无分享,去创建一个
[1] A. Nobel,et al. Energy landscape for large average submatrix detection problems in Gaussian random matrices , 2012, 1211.2284.
[2] Roman Vershynin,et al. Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.
[3] Sundeep Rangan,et al. Iterative estimation of constrained rank-one matrices in noise , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[4] W. Kahan,et al. The Rotation of Eigenvectors by a Perturbation. III , 1970 .
[5] Andrea Montanari,et al. Analysis of Belief Propagation for Non-Linear Problems: The Example of CDMA (or: How to Prove Tanaka's Formula) , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.
[6] Andrea Montanari,et al. The dynamics of message passing on dense graphs, with applications to compressed sensing , 2010, 2010 IEEE International Symposium on Information Theory.
[7] Philippe Rigollet,et al. Computational Lower Bounds for Sparse PCA , 2013, ArXiv.
[8] János Komlós,et al. The eigenvalues of random symmetric matrices , 1981, Comb..
[9] A. Nobel,et al. On the size and recovery of submatrices of ones in a random binary matrix , 2008 .
[10] Michael I. Jordan,et al. Graphical Models, Exponential Families, and Variational Inference , 2008, Found. Trends Mach. Learn..
[11] Dongning Guo,et al. Asymptotic Mean-Square Optimality of Belief Propagation for Sparse Linear Systems , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Chengdu.
[12] Moni Naor,et al. What Can be Computed Locally? , 1995, SIAM J. Comput..
[13] U. Feige,et al. Finding hidden cliques in linear time , 2009 .
[14] Jun Yin,et al. The Isotropic Semicircle Law and Deformation of Wigner Matrices , 2011, 1110.6449.
[15] N. Alon,et al. On the concentration of eigenvalues of random symmetric matrices , 2000, math-ph/0009032.
[16] A. Nobel,et al. Finding large average submatrices in high dimensional data , 2009, 0905.1682.
[17] Patrick Billingsley,et al. Probability and Measure. , 1986 .
[18] Andrea Montanari,et al. Message-passing algorithms for compressed sensing , 2009, Proceedings of the National Academy of Sciences.
[19] Rüdiger L. Urbanke,et al. Modern Coding Theory , 2008 .
[20] Jukka Suomela,et al. Survey of local algorithms , 2013, CSUR.
[21] Nathan Linial,et al. Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..
[22] I. Johnstone,et al. On Consistency and Sparsity for Principal Components Analysis in High Dimensions , 2009, Journal of the American Statistical Association.
[23] Yi Ma,et al. Robust principal component analysis? , 2009, JACM.
[24] Noga Alon,et al. Finding a large hidden clique in a random graph , 1998, SODA '98.
[25] Andrea Montanari,et al. Universality in Polytope Phase Transitions and Message Passing Algorithms , 2012, ArXiv.
[26] E. Candès,et al. Detection of an anomalous cluster in a network , 2010, 1001.3209.
[27] Nir Friedman,et al. Probabilistic Graphical Models - Principles and Techniques , 2009 .