Picture for Michael Mitzenmacher

Michael Mitzenmacher

Harvard University

Optimal Learning of Joint Alignments with a Faulty Oracle

Add code
Sep 21, 2019
Viaarxiv icon

The Supermarket Model with Known and Predicted Service Times

Add code
May 23, 2019
Figure 1 for The Supermarket Model with Known and Predicted Service Times
Figure 2 for The Supermarket Model with Known and Predicted Service Times
Figure 3 for The Supermarket Model with Known and Predicted Service Times
Figure 4 for The Supermarket Model with Known and Predicted Service Times
Viaarxiv icon

Online Pandora's Boxes and Bandits

Add code
Jan 30, 2019
Viaarxiv icon

A Model for Learned Bloom Filters, and Optimizing by Sandwiching

Add code
Jan 03, 2019
Figure 1 for A Model for Learned Bloom Filters, and Optimizing by Sandwiching
Viaarxiv icon

Predicting Positive and Negative Links with Noisy Queries: Theory & Practice

Add code
Aug 07, 2018
Figure 1 for Predicting Positive and Negative Links with Noisy Queries: Theory & Practice
Figure 2 for Predicting Positive and Negative Links with Noisy Queries: Theory & Practice
Figure 3 for Predicting Positive and Negative Links with Noisy Queries: Theory & Practice
Figure 4 for Predicting Positive and Negative Links with Noisy Queries: Theory & Practice
Viaarxiv icon

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

Add code
Feb 21, 2016
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

Theoretical Foundations of Equitability and the Maximal Information Coefficient

Add code
May 12, 2015
Figure 1 for Theoretical Foundations of Equitability and the Maximal Information Coefficient
Figure 2 for Theoretical Foundations of Equitability and the Maximal Information Coefficient
Figure 3 for Theoretical Foundations of Equitability and the Maximal Information Coefficient
Figure 4 for Theoretical Foundations of Equitability and the Maximal Information Coefficient
Viaarxiv icon

Coding for Random Projections and Approximate Near Neighbor Search

Add code
Mar 31, 2014
Figure 1 for Coding for Random Projections and Approximate Near Neighbor Search
Figure 2 for Coding for Random Projections and Approximate Near Neighbor Search
Figure 3 for Coding for Random Projections and Approximate Near Neighbor Search
Figure 4 for Coding for Random Projections and Approximate Near Neighbor Search
Viaarxiv icon

Equitability Analysis of the Maximal Information Coefficient, with Comparisons

Add code
Aug 14, 2013
Figure 1 for Equitability Analysis of the Maximal Information Coefficient, with Comparisons
Figure 2 for Equitability Analysis of the Maximal Information Coefficient, with Comparisons
Figure 3 for Equitability Analysis of the Maximal Information Coefficient, with Comparisons
Figure 4 for Equitability Analysis of the Maximal Information Coefficient, with Comparisons
Viaarxiv icon

Coding for Random Projections

Add code
Aug 09, 2013
Figure 1 for Coding for Random Projections
Figure 2 for Coding for Random Projections
Figure 3 for Coding for Random Projections
Figure 4 for Coding for Random Projections
Viaarxiv icon