Johan von Tangen Sivertsen
Johan von Tangen Sivertsen
Verified email at - Homepage
TitleCited byYear
Approximate furthest neighbor in high dimensions
R Pagh, F Silvestri, J Sivertsen, M Skala
International Conference on Similarity Search and Applications, 3-14, 2015
Scalable and robust set similarity join
T Christiani, R Pagh, J Sivertsen
2018 IEEE 34th International Conference on Data Engineering (ICDE), 1240-1243, 2018
Distance sensitive bloom filters without false negatives
M Goswami, R Pagh, F Silvestri, J Sivertsen
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
Approximate furthest neighbor with application to annulus query
R Pagh, F Silvestri, J Sivertsen, M Skala
Information Systems 64, 152-162, 2017
Scalable learning through linearithmic time kernel approximation techniques
J von Tangen Sivertsen
Master’s thesis, IT University of Copenhagen, 2014
Fast nearest neighbor preserving embeddings
J Sivertsen
arXiv preprint arXiv:1707.06867, 2017
The space complexity of inner product filters
R Pagh, J Sivertsen
arXiv preprint arXiv:1909.10766, 2019
Similarity Problems in High Dimensions
JT Sivertsen
arXiv preprint arXiv:1906.04842, 2019
ITU DS.: Similarity Problems in High Dimensions. D-2018-140
J Sivertsen
Distance Sensitive Bloom Filters
M Goswami, R Pagh, F Silvestri, J Sivertsen
The system can't perform the operation now. Try again later.
Articles 1–10