Thomas D. Ahle

According to our database, Thomas D. Ahle authored at least 16 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Tiling with Squares and Packing Dominos in Polynomial Time.

Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle, Peter M. R. Rasmussen

ACM Trans. Algorithms, July, 2023

Favour: FAst Variance Operator for Uncertainty Rating.

Thomas D. Ahle, Sahar Karimi, Peter Tak Peter Tang

CoRR, 2023

Clustering the Sketch: Dynamic Compression for Embedding Tables.

Henry Ling-Hei Tsang, Thomas D. Ahle

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

Clustering Embedding Tables, Without First Learning Them.

Henry Ling-Hei Tsang, Thomas Dybdahl Ahle

CoRR, 2022

2020

The Power of Hashing with Mersenne Primes.

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

CoRR, 2020

On the Problem of p₁^-1 in Locality-Sensitive Hashing.

Thomas Dybdahl Ahle

CoRR, 2020

Oblivious Sketching of High-Degree Polynomial Kernels.

Thomas D. Ahle, Michael Kapralov, Jakob Bæk Tejs Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, Amir Zandieh

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Similarity Search with Tensor Core Units.

Thomas D. Ahle, Francesco Silvestri

Proceedings of the Similarity Search and Applications - 13th International Conference, 2020

On the Problem of p_1^-1 in Locality-Sensitive Hashing.

Thomas Dybdahl Ahle

Proceedings of the Similarity Search and Applications - 13th International Conference, 2020

Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search.

Thomas D. Ahle, Jakob Bæk Tejs Knudsen

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Almost Optimal Tensor Sketch.

Thomas D. Ahle, Jakob Bæk Tejs Knudsen

CoRR, 2019

Subsets and Supermajorities: Unifying Hashing-based Set Similarity Search.

Thomas Dybdahl Ahle

CoRR, 2019

2017

Parameter-free Locality Sensitive Hashing for Spherical Range Reporting.

Thomas D. Ahle, Martin Aumüller, Rasmus Pagh

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Optimal Las Vegas Locality Sensitive Data Structures.

Thomas Dybdahl Ahle

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

High-dimensional Spherical Range Reporting by Output-Sensitive Multi-Probing LSH.

Thomas D. Ahle, Martin Aumüller, Rasmus Pagh

CoRR, 2016

On the Complexity of Inner Product Similarity Join.

Thomas Dybdahl Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016