Search Results for author:
Found 4 papers, 2 papers with code
Practical Hash Functions for Similarity Estimation and Dimensionality Reduction
We find that mixed tabulation hashing is almost as fast as the multiply-mod-prime scheme ax+b mod p. Mutiply-mod-prime is guaranteed to work well on sufficiently random data, but we demonstrate that in the above applications, it can lead to bias and poor concentration on both real-world and synthetic data.
Consistent Hashing with Bounded Loads
Designing algorithms for balanced allocation of clients to servers in dynamic settings is a challenging problem for a variety of reasons.
Data Structures and Algorithms
Heavy hitters via cluster-preserving clustering
Our main innovation is an efficient reduction from the heavy hitters to a clustering problem in which each heavy hitter is encoded as some form of noisy spectral cluster in a much bigger graph, and the goal is to identify every cluster.
How to Cut Corners and Get Bounded Convex Curvature
A region of points in the plane $Q$ has \emph{bounded convex curvature} if for any point $x\in\partial Q$, there is a unit disk $U$ and $\varepsilon>0$ such that $x\in \partial U$ and all points in $U$ within distance $\varepsilon$ from $x$ are in $Q$.
Computational Geometry
