2 papers
cs.DS2026
Modern Minimal Perfect Hashing: A Survey
Hans-Peter Lehmann, Thomas Mueller, Rasmus Pagh +4
Given a set of keys, a perfect hash function for maps the keys in to the first integers without collisions. It may return an arbitrary result for any key…
cs.DS2025
Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
Ninh Pham, Rasmus Pagh
Approximation of non-linear kernels using random feature maps has become a powerful technique for scaling kernel methods to large datasets. We propose , an…