Thomas Dybdahl Ahle

activity

20152026

most citedOn the Complexity of Inner Product Similarity Join

27 citations · 57 across the 10 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

cs.DS2020

The Power of Hashing with Mersenne Primes

Thomas Dybdahl Ahle, Jakob Tejs Bæk Knudsen, Mikkel Thorup

The classic way of computing a $k$ -universal hash function is to use a random degree- $(k - 1)$ polynomial over a prime field $Z_{p}$ . For a fast computation of the polynomial,…

cs.DS2020

Similarity Search with Tensor Core Units

Thomas D. Ahle, Francesco Silvestri

Tensor Core Units (TCUs) are hardware accelerators developed for deep neural networks, which efficiently support the multiplication of two dense $m \times m$ matrices,…

cs.DS2020

On the Problem of $p_{1}^{- 1}$ in Locality-Sensitive Hashing

Thomas Dybdahl Ahle

A Locality-Sensitive Hash (LSH) function is called $(r, cr, p_{1}, p_{2})$ -sensitive, if two data-points with a distance less than $r$ collide with probability at least $p_{1}$ while data p…

The Power of Hashing with Mersenne Primes

Similarity Search with Tensor Core Units

On the Problem of p1−1​ in Locality-Sensitive Hashing

On the Problem of $p_{1}^{- 1}$ in Locality-Sensitive Hashing