Similar Items: Nearly Optimal Attention Coresets
- Nearly-Tight Bounds for Zonotope Containment and Beyond
- Smallest suffixient set maintenance in near-real-time
- Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs
- Positional LSH: Binary Block Matrix Approximation for Attention with Linear Biases
- A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
- Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth