250 citations · 1.1k across the 76 of their papers we have counts for
7 papers · 1 filter
Arithmetic Progression Hypergraphs: Examining the Second Moment Method
Michael Mitzenmacher
In many data structure settings, it has been shown that using "double hashing" in place of standard hashing, by which we mean choosing multiple hash values according to an arithmet…
Weightless: Lossy Weight Encoding For Deep Neural Network Compression
Brandon Reagen, Udit Gupta, Robert Adolf +4
The large memory requirements of deep neural networks limit their deployment and adoption on many devices. Model compression methods effectively reduce the memory requirements of t…
EMOMA: Exact Match in One Memory Access
Salvatore Pontarelli, Pedro Reviriego, Michael Mitzenmacher
An important function in modern routers and switches is to perform a lookup for a key. Hash-based methods, and in particular cuckoo hash tables, are popular for such lookup operati…
Simulated Annealing for JPEG Quantization
Max Hopkins, Michael Mitzenmacher, Sebastian Wagner-Carena
JPEG is one of the most widely used image formats, but in some ways remains surprisingly unoptimized, perhaps because some natural optimizations would go outside the standard that…
Predicting Positive and Negative Links with Noisy Queries: Theory & Practice
Charalampos E. Tsourakakis, Michael Mitzenmacher, Kasper Green Larsen +4
Social networks involve both positive and negative relationships, which can be captured in signed graphs. The {\em edge sign prediction problem} aims to predict whether an interact…
Reconciling Graphs and Sets of Sets
Michael Mitzenmacher, Tom Morgan
We explore a generalization of set reconciliation, where the goal is to reconcile sets of sets. Alice and Bob each have a parent set consisting of child sets, each containing a…