- 18 results
Search results
-
2018
CoveringLSH: Locality-sensitive Hashing without False Negatives
Pagh, R., 2018, In: A C M Transactions on Algorithms. 14, 3, p. 1-11 11 p., 29.Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
Open AccessFile -
Scalable and Robust Set Similarity Join
Christiani, T. L., Pagh, R. & Sivertsen, J. V. T., 2018, Proceedings of IEEE 34th International Conference on Data Engineering (ICDE). IEEE, (Proceedings of the International Conference on Data Engineering).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
Set Similarity Search for Skewed Data
McCauley, S., Mikkelsen, J. W. & Pagh, R., 2018, Proceedings of Principles of Database Systems (PODS). Association for Computing Machinery, p. 63-74Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
Similarity Sketching
Pagh, R., 2018, Encyclopedia of Big Data Technologies. SpringerResearch output: Conference Article in Proceeding or Book/Report chapter › Encyclopedia chapter › Communication
-
2017
Hardness and Approximation of High-Dimensional Search Problems
Pagh, R., 2017.Research output: Contribution to conference - NOT published in proceeding or journal › Conference abstract for conference › Research › peer-review
Open Access -
I/O-efficient Similarity Join
Pagh, R., Pham, N. D., Silvestri, F. & Stöckel, M. D., 2017, In: Algorithmica. 78Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
Open Access -
Parameter-free Locality Sensitive Hashing for Spherical Range Reporting
Ahle, T. D., Pagh, R. & Aumüller, M., 2017, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 18 p.Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
Range-efficient consistent sampling and locality-sensitive hashing for polygons
Gudmundsson, J. & Pagh, R., 2017, Proceedings of 28th International Symposium on Algorithms and Computation (ISAAC 2017). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 15 p. (Leibniz International Proceedings in Informatics).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open Access -
Set Similarity Search Beyond Minhash
Christiani, T. L. & Pagh, R., 2017, Proceedings of 47th ACM Symposium on Theory of Computing (STOC). Association for Computing MachineryResearch output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open Access -
Theory and Applications of Hashing (Dagstuhl Seminar 17181)
Dietzfelbinger, M., Mitzenmacher, M., Pagh, R. & Woodruff, D., 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. (Dagstuhl Reports; No. 5, Vol. 7).Research output: Book / Anthology / Report › Report › Research
Open Access -
2016
Approximate furthest neighbor with application to annulus query
Pagh, R., Silvestri, F., Sivertsen, J. V. T. & Skala, M., 22 Jul 2016, In: Information Systems.Research output: Journal Article or Conference Article in Journal › Conference article › Research › peer-review
Open Access -
COMPUTER-IMPLEMENTED METHOD OF PERFORMING A SEARCH USING SIGNATURES
Pagh, R. (Inventor), 22 Dec 2016, IPC No. G06F17/30, Patent No. US2016371331 (A1) ― 2016-12-22, Priority date 19 Jun 2015, Priority No. DKPA201570376 20150619Research output: Patent
-
Locality-sensitive Hashing without False Negatives
Pagh, R., 2016, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, p. 1-9Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
-
On the Complexity of Inner Product Similarity Join
Ahle, T. D., Pagh, R., Razenshteyn, I. & Silvestri, F., 2016, PODS '16 Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Association for Computing Machinery, p. 151-164Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open Access -
Scalability and Total Recall with Fast CoveringLSH
Pham, N. D. & Pagh, R., 2016, Proceedings of the 25th ACM International on Conference on Information and Knowledge Management: CIKM '16. Association for Computing Machinery, p. 1109-1118Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
2015
Approximate Range Emptiness in Constant Time and Optimal Space
Goswami, M., Jørgensen, A. G., Larsen, K. G. & Pagh, R., 2015, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, p. 769-775Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
-
I/O-Efficient Similarity Join
Pagh, R., Pham, N. D., Silvestri, F. & Stöckel, M., 14 Sept 2015, Algorithms - ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings. Springer, p. 941-952 12 p. (Lecture Notes in Computer Science, Vol. 9294).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
Large-Scale Similarity Joins With Guarantees
Pagh, R., 2015, 18th International Conference on Database Theory (ICDT 2015). Vol. 31. p. 15-24 (Leibniz International Proceedings in Informatics).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile