Algorithms

  • Postal addressShow on map

    4B corridor

    2300 Copenhagen

    Denmark

Filter
Article in proceedings

Search results

  • 2019

    Fragile Complexity of Comparison-Based Algorithms

    Afshani, P., Fagerberg, R., Hammer, D. M. G., Jacob, R., Kostitsyna, I., Meyer, U., Penschuck, M. & Sitchinava, N., 9 Sept 2019, 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl--Leibniz-Zentrum für Informatik, p. 2:1–2:19 2. (Leibniz International Proceedings in Informatics (LIPIcs)).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Hardness of Bichromatic Closest Pair with Jaccard Similarity

    Pagh, R., Nielsen, N. M. S. & Thorup, M., 2019, LIPIcs - Leibniz International Proceedings in Informatics - 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Vol. 144. p. 80:1–80:13 13 p. 80. (Leibniz International Proceedings in Informatics).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Lower Bounds for Oblivious Data Structures

    Jacob, R., Larsen, K. G. & Nielsen, J. B., 6 Jan 2019, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • MIWAE: Deep Generative Modelling and Imputation of Incomplete Data

    Mattei, P.-A. & Frellsen, J., 2019, Proceedings of the 36th International Conference on Machine Learning, PMLR . Vol. 97. p. 4413-4423

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Parameterized Streaming Algorithms for Min-Ones d-SAT

    Agrawal, A., Biswas, A., Bonnet, É., Brettell, N., Curticapean, R.-C., Marx, D., Miltzow, T., Raman, V. & Saurabh, S., 2019, 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum für Informatik, p. 8:1-8:20 20 p. (Leibniz International Proceedings in Informatics (LIPIcs)).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Partially Exchangeable Networks and Architectures for Learning Summary Statistics in Approximate Bayesian Computation

    Wiqvist, S., Mattei, P.-A., Picchini, U. & Frellsen, J., 2019, Proceedings of the 36th International Conference on Machine Learning, PMLR. Vol. 97. p. 6798-6807

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors

    Christiani, T. L., Pagh, R., Aumüller, M. & Vesterli, M. E., 2019, 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, p. 1-16 16 p. 10

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Recurrent models and lower bounds for projective syntactic decoding

    Schluter, N., 2019, Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. Association for Computational Linguistics, Vol. Volume 1 (Long and Short Papers). p. 251-260 10 p.

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme

    Aumüller, M. & Hass, N., 2019, 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX). Society for Industrial and Applied Mathematics, 14 p.

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Space-efficient Feature Maps for String Alignment Kernels

    Tabei, Y., Yamanishi, Y. & Pagh, R., 2019, IEEE International Conference on Data Mining (ICDM). IEEE Computer Society Press, (IEEE International Conference on Data Mining (ICDM)).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms

    Chen, H., Curticapean, R.-C. & Dell, H., 2019, Graph-Theoretic Concepts in Computer Science: 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers. Springer, p. 364-378 (Lecture Notes in Computer Science, Vol. 11789).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • The Lacunae of Danish Natural Language Processing

    Kirkedal, A. S., Plank, B., Derczynski, L. & Schluter, N., 2019, Proceedings of the Nordic Conference of Computational Linguistics (2019). Linköping University Electronic Press, p. 356–362 (NEALT (Northern European Association of Language Technology) Proceedings Series).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • The Role of Local Intrinsic Dimensionality in Benchmarking Nearest Neighbor Search

    Aumüller, M. & Ceccarello, M., 17 Jul 2019, International Conference on Similarity Search and Applications: SISAP 2019: Similarity Search and Applications . Springer, (Lecture Notes in Computer Science, Vol. 11807).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File
  • 2018

    Adaptive MapReduce Similarity Joins

    McCauley, S. & Silvestri, F., 2018, Proceedings of the 5th ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond: BeyondMR'18. Association for Computing Machinery

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Baselines and test data for cross-lingual inference

    Agic, Z. & Schluter, N., 7 May 2018, Proceedings of the Eleventh International Conference on Language Resources and Evaluation (LREC 2018). European Language Resources Association, p. 3890-3894 5 p.

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Bloom Filters, Adaptivity, and the Dictionary Problem

    Bender, M., Farach-Colton, M., Goswami, M., Johnson, R., McCauley, S. & Singh, S., 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). IEEE

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Cache Oblivious Sparse Matrix Multiplication

    Dusefante, M. & Jacob, R., 13 Mar 2018, Latin American Symposium on Theoretical Informatics: LATIN 2018: Theoretical Informatics . Springer, p. 437-447 (Lecture Notes in Computer Science, Vol. 10807).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Computational Complexity of Proper Equilibrium

    Hansen, K. A. & Lund, T. B., 2018, Proceedings of the 2018 ACM Conference on Economics and Computation: EC '18. Association for Computing Machinery, p. 113-130

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Counting Connected Subgraphs with Maximum-Degree-Aware Sieving

    Björklund, A., Husfeldt, T., Kaski, P. & Koivisto, M., 2018, 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan.. Schloss Dagstuhl--Leibniz-Zentrum für Informatik, Vol. 123. p. 17:1-17:12 12 p. 17. (Leibniz International Proceedings in Informatics).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm

    Björklund, A. & Husfeldt, T., 2018, 29th International Symposium on Algorithms and Computation (ISAAC 2018). Schloss Dagstuhl--Leibniz-Zentrum für Informatik, Vol. 123. p. 19:1-19:13 13 p. (Leibniz International Proceedings in Informatics).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Distance-Sensitive Hashing

    Aumüller, M., Christiani, T. L., Pagh, R. & Silvestri, F., 2018, Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database System. New York, NY, USA: Association for Computing Machinery, p. 89-104 15 p.

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Distant Supervision from Disparate Sources for Low-Resource Part-of-Speech Tagging

    Plank, B. & Agic, Z., 2018, Proceedings of the Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Extensor-coding

    Brand, C., Dell, H. & Husfeldt, T., 2018, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing: STOC 2018. Association for Computing Machinery, p. 151 164 p.

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    File

  • 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 Access
    File

  • 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

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • The glass ceiling in NLP

    Schluter, N., 31 Oct 2018, Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, p. 2793-2798 6 p.

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • The Word Analogy Testing Caveat

    Schluter, N., 1 Jun 2018, Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies : Volume 2 (Short Papers). Association for Computational Linguistics, p. 242–246 5 p.

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Valid, scalable, authentic, on-site, digital, individual assessment of programming skills

    Husfeldt, T., 2018, LTHs 10:e Pedagogiska Inspirationskonferens, 6 december 2018. Lunds Universitet, p. 21 23 p.

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research

    Open Access
    File

  • When data permutations are pathological: the case of neural natural language inference

    Schluter, N. & Varab, D., 31 Oct 2018, Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, p. 4935–4939 5 p.

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File
  • 2017

    A Framework for Similarity Search with Space-Time Tradeoffs using Locality Sensitive Filtering

    Christiani, T. L., 2017, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, p. 31-46

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms

    Aumüller, M., Bernhardsson, E. & Faithfull, A., 2017, International Conference on Similarity Search and Applications: SISAP 2017: Similarity Search and Applications. Springer, p. 34-49 (Lecture Notes in Computer Science, Vol. 10609).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Comparative Study of Inference Methods for Bayesian Nonnegative Matrix Factorisation

    Brouwer, T., Frellsen, J. & Liò, P., 2017, The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database 2017. Springer, p. 513-529 (Lecture Notes in Computer Science, Vol. 10534).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Cross-lingual tagger evaluation without test data

    Agic, Z., Plank, B. & Søgaard, A., 2017, Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics. Association for Computational Linguistics, p. 248-253

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Distance Sensitive Bloom Filters Without False Negatives

    Goswami, M., Pagh, R., Silvestri, F. & Sivertsen, J., 2017, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. Society for Industrial and Applied Mathematics, p. 257-269 13 p.

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • How (not) to train a dependency parser: The curious case of jackknifing part-of-speech taggers

    Agic, Z. & Schluter, N., 2017, Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics, p. 679-684 6 p.

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Lower Bounds in the Asymmetric External Memory Model

    Jacob, R. & Sitchinava, N., Jul 2017, SPAA '17 Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures . Association for Computing Machinery, p. 247-254

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • 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 Access
    File

  • Parsing Universal Dependencies without training

    Martínez Alonso, H., Agic, Z., Plank, B. & Søgaard, A., 2017, Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics. Association for Computational Linguistics, p. 230-240

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • 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 Machinery

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access

  • Spherical convolutions and their application in molecular modelling

    Boomsma, W. & Frellsen, J., 2017, Advances in Neural Information Processing Systems 30: NIPS 2017. Curran Associates, Inc., p. 3436-3446

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • The limits of automatic summarisation according to ROUGE

    Schluter, N., 2017, Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics. Association for Computational Linguistics, Vol. 2. p. 41–45 5 p.

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File
  • 2016

    A Cache-Optimal Alternative to the Unidirectional Hierarchization Algorithm

    Hupp, P. & Jacob, R., 17 Mar 2016, Sparse Grids and Applications - Stuttgart 2014. Springer, p. 103-132 (Lecture Notes in Computational Science and Engineering, Vol. 109).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Approximate unsupervised summary optimisation for selections of ROUGE

    Schluter, N. E. & Martínez Alonso, H., 2016, Proceedings of the 23rd French Conference on Natural Language Processing (Traitement Automatique des Langues Naturelles): Actes de la conférence conjointe JEP-TALN-RECITAL 2016, volume 2 : TALN. Paris, France: Association Francophone pour la Communication Parlée (AFCP) et Association pour le Traitement Automatique des Langues (ATALA), p. 349-354

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access

  • Bit-Vector Search Filtering with Application to a Kanji Dictionary

    Skala, M., 2016, Similarity Search and Applications: 9th International Conference, SISAP 2016, Tokyo, Japan, October 24-26, 2016. Springer, p. 138-150 (Lecture Notes in Computer Science, Vol. 9939).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort

    Aumüller, M., Dietzfelbinger, M., Heuberger, C., Krenn, D. & Prodinger, H., 4 Jul 2016, Proceedings of the 27th Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms. Jagiellonian University in Krakow, 13 p.

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access

  • 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-9

    Research 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-164

    Research 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-1118

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access
    File

  • Timeability in Extensive-Form Games

    Jakobsen, S. K., Sørensen, T. B. & Conitzer, V., 2016, Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science. Sudan, M. (ed.). 7 ed. Association for Computing Machinery, p. 191-199 9 p.

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

    Open Access