Finding needles in compressed haystacks
暂无分享,去创建一个
[1] Rafail Ostrovsky,et al. Efficient search for approximate nearest neighbor in high dimensional spaces , 1998, STOC '98.
[2] R. Calderbank,et al. Compressed Learning : Universal Sparse Dimensionality Reduction and Learning in the Measurement Domain , 2009 .
[3] A. Robert Calderbank,et al. Construction of a Large Class of Deterministic Sensing Matrices That Satisfy a Statistical Isometry Property , 2009, IEEE Journal of Selected Topics in Signal Processing.
[4] Allen Y. Yang,et al. Robust Face Recognition via Sparse Representation , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[5] A. Robert Calderbank,et al. Model selection: Two fundamental measures of coherence and their algorithmic significance , 2009, 2010 IEEE International Symposium on Information Theory.
[6] Stephen J. McKenna,et al. Regular Texture Analysis as Statistical Model Selection , 2008, ECCV.
[7] Nikhil Srivastava,et al. Graph sparsification by effective resistances , 2008, SIAM J. Comput..
[8] Christopher J. C. Burges,et al. A Tutorial on Support Vector Machines for Pattern Recognition , 1998, Data Mining and Knowledge Discovery.
[9] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.