Alert button
Picture for Anshumali Shrivastava

Anshumali Shrivastava

Alert button

Probabilistic Blocking with An Application to the Syrian Conflict

Oct 11, 2018
Rebecca C. Steorts, Anshumali Shrivastava

Figure 1 for Probabilistic Blocking with An Application to the Syrian Conflict
Figure 2 for Probabilistic Blocking with An Application to the Syrian Conflict
Figure 3 for Probabilistic Blocking with An Application to the Syrian Conflict
Viaarxiv icon

Extreme Classification in Log Memory

Oct 09, 2018
Qixuan Huang, Yiqiu Wang, Tharun Medini, Anshumali Shrivastava

Figure 1 for Extreme Classification in Log Memory
Figure 2 for Extreme Classification in Log Memory
Figure 3 for Extreme Classification in Log Memory
Viaarxiv icon

MISSION: Ultra Large-Scale Feature Selection using Count-Sketches

Jun 12, 2018
Amirali Aghazadeh, Ryan Spring, Daniel LeJeune, Gautam Dasarathy, Anshumali Shrivastava, Richard G. Baraniuk

Figure 1 for MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
Figure 2 for MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
Figure 3 for MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
Figure 4 for MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
Viaarxiv icon

Accelerating Dependency Graph Learning from Heterogeneous Categorical Event Streams via Knowledge Transfer

Aug 25, 2017
Chen Luo, Zhengzhang Chen, Lu-An Tang, Anshumali Shrivastava, Zhichun Li

Figure 1 for Accelerating Dependency Graph Learning from Heterogeneous Categorical Event Streams via Knowledge Transfer
Figure 2 for Accelerating Dependency Graph Learning from Heterogeneous Categorical Event Streams via Knowledge Transfer
Figure 3 for Accelerating Dependency Graph Learning from Heterogeneous Categorical Event Streams via Knowledge Transfer
Figure 4 for Accelerating Dependency Graph Learning from Heterogeneous Categorical Event Streams via Knowledge Transfer
Viaarxiv icon

Arrays of (locality-sensitive) Count Estimators (ACE): High-Speed Anomaly Detection via Cache Lookups

Jun 20, 2017
Chen Luo, Anshumali Shrivastava

Figure 1 for Arrays of (locality-sensitive) Count Estimators (ACE): High-Speed Anomaly Detection via Cache Lookups
Figure 2 for Arrays of (locality-sensitive) Count Estimators (ACE): High-Speed Anomaly Detection via Cache Lookups
Figure 3 for Arrays of (locality-sensitive) Count Estimators (ACE): High-Speed Anomaly Detection via Cache Lookups
Figure 4 for Arrays of (locality-sensitive) Count Estimators (ACE): High-Speed Anomaly Detection via Cache Lookups
Viaarxiv icon

A New Unbiased and Efficient Class of LSH-Based Samplers and Estimators for Partition Function Computation in Log-Linear Models

Mar 15, 2017
Ryan Spring, Anshumali Shrivastava

Figure 1 for A New Unbiased and Efficient Class of LSH-Based Samplers and Estimators for Partition Function Computation in Log-Linear Models
Figure 2 for A New Unbiased and Efficient Class of LSH-Based Samplers and Estimators for Partition Function Computation in Log-Linear Models
Figure 3 for A New Unbiased and Efficient Class of LSH-Based Samplers and Estimators for Partition Function Computation in Log-Linear Models
Figure 4 for A New Unbiased and Efficient Class of LSH-Based Samplers and Estimators for Partition Function Computation in Log-Linear Models
Viaarxiv icon

Optimal Densification for Fast and Accurate Minwise Hashing

Mar 14, 2017
Anshumali Shrivastava

Figure 1 for Optimal Densification for Fast and Accurate Minwise Hashing
Figure 2 for Optimal Densification for Fast and Accurate Minwise Hashing
Figure 3 for Optimal Densification for Fast and Accurate Minwise Hashing
Figure 4 for Optimal Densification for Fast and Accurate Minwise Hashing
Viaarxiv icon

Revisiting Winner Take All (WTA) Hashing for Sparse Datasets

Dec 07, 2016
Beidi Chen, Anshumali Shrivastava

Figure 1 for Revisiting Winner Take All (WTA) Hashing for Sparse Datasets
Figure 2 for Revisiting Winner Take All (WTA) Hashing for Sparse Datasets
Figure 3 for Revisiting Winner Take All (WTA) Hashing for Sparse Datasets
Figure 4 for Revisiting Winner Take All (WTA) Hashing for Sparse Datasets
Viaarxiv icon

Scalable and Sustainable Deep Learning via Randomized Hashing

Dec 05, 2016
Ryan Spring, Anshumali Shrivastava

Figure 1 for Scalable and Sustainable Deep Learning via Randomized Hashing
Figure 2 for Scalable and Sustainable Deep Learning via Randomized Hashing
Figure 3 for Scalable and Sustainable Deep Learning via Randomized Hashing
Figure 4 for Scalable and Sustainable Deep Learning via Randomized Hashing
Viaarxiv icon

2-Bit Random Projections, NonLinear Estimators, and Approximate Near Neighbor Search

Feb 21, 2016
Ping Li, Michael Mitzenmacher, Anshumali Shrivastava

Figure 1 for 2-Bit Random Projections, NonLinear Estimators, and Approximate Near Neighbor Search
Figure 2 for 2-Bit Random Projections, NonLinear Estimators, and Approximate Near Neighbor Search
Figure 3 for 2-Bit Random Projections, NonLinear Estimators, and Approximate Near Neighbor Search
Figure 4 for 2-Bit Random Projections, NonLinear Estimators, and Approximate Near Neighbor Search
Viaarxiv icon