Följ
Tobias Christiani
Tobias Christiani
Verifierad e-postadress på oracle.com
Titel
Citeras av
Citeras av
År
Set similarity search beyond minhash
T Christiani, R Pagh
Proceedings of the 49th annual ACM SIGACT symposium on theory of computing …, 2017
552017
A framework for similarity search with space-time tradeoffs using locality-sensitive filtering
T Christiani
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
542017
Scalable and robust set similarity join
T Christiani, R Pagh, J Sivertsen
2018 IEEE 34th International Conference on Data Engineering (ICDE), 1240-1243, 2018
372018
Distance-sensitive hashing
M Aumüller, T Christiani, R Pagh, F Silvestri
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2018
312018
PUFFINN: parameterless and universally fast finding of nearest neighbors
M Aumüller, T Christiani, R Pagh, M Vesterli
arXiv preprint arXiv:1906.12211, 2019
282019
Fast locality-sensitive hashing frameworks for approximate near neighbor search
T Christiani
International Conference on Similarity Search and Applications, 3-17, 2019
242019
From independence to expansion and back again
T Christiani, R Pagh, M Thorup
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
222015
Generating k-independent variables in constant time
T Christiani, R Pagh
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 196-205, 2014
132014
Dartminhash: Fast sketching for weighted sets
T Christiani
arXiv preprint arXiv:2005.11547, 2020
82020
Confirmation sampling for exact nearest neighbor search
T Christiani, R Pagh, M Thorup
International Conference on Similarity Search and Applications, 97-110, 2020
62020
Fast locality-sensitive hashing for approximate near neighbor search
T Christiani
CoRR, abs/1708.07586, 2017
42017
Algorithms for Similarity Search and Pseudorandomness
T Christiani
arXiv preprint arXiv:1906.09430, 2019
2019
Optimal Boolean Locality-Sensitive Hashing
T Christiani
arXiv preprint arXiv:1812.01557, 2018
2018
ITU DS.: Algorithms for Similarity Search and Pseudorandomness. D-2018-145
T Christiani
2018
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–14