Ping Li, Cun-hui Zhang, and Tong Zhang
Compressed Counting Meets Compressed Sensing
|
Ping Li, Anshumali Shrivastava, Art Owen, Cun-hui Zhang
Densified One Permutation Hashing for Efficient Near Neighbor Search
|
Anshumali Shrivastava and Ping Li
Asymmetric Hashing for Efficient Near Neighbor Search
|
Ping Li, Chris Burges, and Qiang Wu
McRank: Learning to Rank Using Multiple Classifications and Gradient Boosting,
|
Ping Li, Trevor Hastie, and Kenneth W. Church
Very Sparse Random Projections,
|
Ping Li, Christian Konig, Anshumali Shrivastava, Josh Moore, Art Owen, Cun-Hui Zhang
Hashing Algorithms for Large-Scale Search & Learning
|
Ping Li
Adaptive Base Class (ABC) Boosting
|
Ping Li and Cun-Hui Zhang
Compressed Counting
|
Ping Li, Gennady Samorodnitsky, and John Hopcroft
Sign Cauchy Projections
|
Anshumali Shrivastava, Ping Li, and Michael Mitzenmacher
Hashing for Near Neighbor Search
|
Ping Li, Kenneth Church, and Trevor Hastie. (Essential idea on Figure 3)
2005 sktech paper on Conditional Random Sampling (CRS) using smallest k sketches.
2006 paper generalized CRS to real-valued data.
|
Martin Slawski and Ping Li
b-Bit Marginal Regression
|
Jian Wang and Ping Li
Recovery of Sparse Signals Using Multiple Orthogonal Least Squares
|
Guangcan Liu and Ping Li
Recovery of Coherent Data via Low-Rank Dictionary Pursuit
|
Anshumali Shrivastava and Ping Li
A New Space for Comparing Graphs
|