1 citations · 2 across the 3 of their papers we have counts for
4 papers · 1 filter
Huffman-Bucket Sketch: A Simple Algorithm for Cardinality Estimation
Matti Karppa
We introduce the Huffman-Bucket Sketch (HBS), a simple, mergeable data structure that losslessly compresses a HyperLogLog (HLL) sketch with registers to optimal space $O(m+\log…
Engineering Compressed Matrix Multiplication with the Fast Walsh-Hadamard Transform
Joel Andersson, Matti Karppa
We present an implementation of Pagh's compressed matrix multiplication algorithm, a randomized algorithm that constructs sketches of matrices to compute an unbiased estimate of th…
HyperLogLogLog: Cardinality Estimation With One Log More
Matti Karppa, Rasmus Pagh
We present HyperLogLogLog, a practical compression of the HyperLogLog sketch that compresses the sketch from bits down to $m \log_2\log_2\log_2 m + O(m+\log\log n)…
Engineering Boolean Matrix Multiplication for Multiple-Accelerator Shared-Memory Architectures
Matti Karppa, Petteri Kaski
We study the problem of multiplying two bit matrices with entries either over the Boolean algebra or over the binary field . We engineer high-per…