Re-randomized Densification for One Permutation Hashing and Bin-wise Consistent Weighted Sampling | 0 | 0.34 | 2019 |
Statistically Optimal And Computationally Efficient Low Rank Tensor Completion From Noisy Entries | 1 | 0.36 | 2017 |
Theory of the GMM Kernel. | 4 | 0.40 | 2017 |
Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completion. | 5 | 0.41 | 2017 |
Sparse Recovery with Very Sparse Compressed Counting. | 4 | 0.44 | 2014 |
Paths Following Algorithm for Penalized Logistic Regression Using SCAD and MCP. | 1 | 0.36 | 2014 |
Optimality of graphlet screening in high dimensional variable selection | 1 | 0.36 | 2014 |
On Tensor Completion via Nuclear Norm Minimization. | 17 | 0.66 | 2014 |
Sparse matrix inversion with scaled Lasso | 9 | 0.90 | 2013 |
Exact sparse recovery with L0 projections | 2 | 0.39 | 2013 |
Compressed Counting Meets Compressed Sensing. | 9 | 0.54 | 2013 |
A nonparametric empirical Bayes approach to adaptive minimax estimation | 1 | 0.98 | 2013 |
One Permutation Hashing. | 15 | 0.64 | 2012 |
Estimation and Selection via Absolute Penalized Convex Minimization And Its Multistage Adaptive Applications. | 4 | 0.65 | 2012 |
Transelliptical Graphical Models. | 4 | 0.47 | 2012 |
One Permutation Hashing for Efficient Search and Learning | 4 | 0.40 | 2012 |
Entropy Estimations Using Correlated Symmetric Stable Random Projections. | 3 | 0.39 | 2012 |
Calibrated Elastic Regularization in Matrix Completion. | 3 | 0.38 | 2012 |
A New Algorithm for Compressed Counting with Applications in Shannon Entropy Estimation in Dynamic Data | 0 | 0.34 | 2011 |
A New Algorithm for Compressed Counting with Applications in Shannon Entropy Estimation in Dynamic Data. | 9 | 0.58 | 2011 |
Rate Minimaxity of the Lasso and Dantzig Selector for the lq Loss in lr Balls | 3 | 0.66 | 2010 |
Measures of Network Vulnerability | 4 | 0.75 | 2007 |
Concave Learners for Rankboost | 0 | 0.34 | 2007 |
A generalization of the two-dimensional prolate spheroidal wave function method for nonrectilinear MRI data acquisition methods | 2 | 0.84 | 2006 |
What Is The Real Size Of A Sampled Network? The Case Of The Internet | 15 | 1.05 | 2005 |
A probability model for combining ranks | 1 | 0.45 | 2005 |
Mixed group ranks: preference and confidence in classifier combination. | 34 | 2.23 | 2004 |
A modified Weiszfeld algorithm for the Fermat-Weber location problem | 19 | 2.08 | 2001 |