Algorithms

Publikation

Publikationer pr. år 2012 2013 2014 2015 2016 2017 2018 2019 2020 2022 2023 2025

• 131 Konferencebidrag i proceedings
• 57 Tidsskriftartikel
• 11 Konferenceartikel
• 7 Ph.d.-afhandling
• 34 Mere
  • 5 Bidrag til bog/antologi
  • 5 Paper
  • 4 Preprint
  • 3 Encyclopædiartikel
  • 2 Antologi
  • 2 Rapport
  • 2 Konferenceabstrakt til konference
  • 2 Bidrag til avis - Kronik
  • 2 Bidrag til avis - Avisartikel
  • 1 Forord/efterskrift
  • 1 Poster
  • 1 Bidrag til avis - Kommentar/debat
  • 1 Udgivelser på nettet - Net-publikation
  • 1 Andet bidrag
  • 1 Patent
  • 1 Working paper

Publikationer pr. år

Publikationer pr. år

Søgeresultater

• 2022

  Sampling near neighbors in search for fairness

  Aumüller, M., Har-Peled, S., Mahabadi, S., Pagh, R. & Silvestri, F., 2022, I: Communications of the A C M. 65, 8, s. 83-90

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Åben adgang

  Fil

  • Locality Sensitive Hashing 100%
  • Nearest Neighbor 100%
  • Nearest Neighbor Problem 100%
  • Data Structure 100%
  • Similarity Search 50%

• Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication.

  Limaye, N., Srinivasan, S. & Tavenas, S., 2022, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing. s. 416-425

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

• Taming Graphs with No Large Creatures and Skinny Ladders

  Gajarsky, J., Jaffke, L., Thomé de Lima, P., Novotná, J., Pilipczuk, M., Rzążewski, P. & Souza, U., 2022, Proceedings of the 30th Annual European Symposium on Algorithms (ESA 2022). Dagstuhl Publishing, Germany

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

• Universal Sorting: Finding a DAG using Priced Comparisons

  Jacob, R. & Goswami, M., 8 nov. 2022, 40 s.

  Publikation: Bog / Antologi / Rapport › Rapport › Forskning

  Åben adgang

  • Competitive Ratio 100%
  • Bichromatic 75%
  • Sorting Task 50%
  • Randomized Algorithms 25%
  • Optimal Algorithm 25%

• Well-partitioned chordal graphs

  Ahn, J., Jaffke, L., Kwon, O.-J. & Thomé de Lima, P., 2022, I: Discrete Mathematics. 23 s., 112985.

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Åben adgang

  Fil

  • Well-partitioned Chordal Graph 100%
  • Polynomial Time 100%
  • Clique 75%
  • Edge 50%
  • Vertex Set 37%

• XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure

  Bodlaender, H., Groenland, C., Jacob, H., Jaffke, L. & Thomé de Lima, P., 2022, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  • Linear Structure 100%
  • Parameterized Problems 100%
  • Dominating Set 100%
  • Capacitated 50%
  • Natural Places 50%
• 2021

  A full complexity dichotomy for immanant families

  Curticapean, R.-C., 15 jun. 2021, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, s. 1770 14 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Complexity Dichotomy 100%
  • Immanants 100%
  • Polynomial Time 100%
  • Algebraic Complexity 25%
  • Computable 25%

• Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model

  Jacob, R., Sitchinava, N. & Goodrich, M. T., 14 jan. 2021, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, s. 2141-2153 13 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Butterfly Network 100%
  • Non-atomic 100%
  • Fork-Join Model 100%
  • Memory Access 100%
  • Join Operation 100%

• Computational Complexity of Computing a Quasi-Proper Equilibrium

  Lund, T. B. & Hansen, K. A., 2021, Fundamentals of Computation Theory : 23rd International Symposium, FCT 2021 Athens, Greece, September 12–15, 2021 Proceedings. Cham, s. 259-271 13 s. (Lecture Notes in Computer Science, Bind 12867).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Computational Complexity 100%
  • Proper Equilibrium 100%
  • Extensive Form Game 100%
  • Polynomial Time 100%
  • Linear Programming 100%

• Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access

  Aumüller, M., Pagh, R. & Lebeda, C. J., 2021, Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery, 14 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Fast Access 100%
  • Differentially Private 100%
  • Access to Space 100%
  • Low Error 100%
  • Optimal Spaces 100%

• Differential Privacy in Distributed Settings

  Nielsen, N. M. S., 2021, IT-Universitetet i København. 102 s.

  Publikation: Afhandlinger › Ph.d.-afhandling

  Åben adgang

  Fil

  • Distributed Settings 100%
  • Differential Privacy 100%
  • Cardinality 100%
  • Symmetric Difference 66%
  • Euclidean Distance 66%

• Efficient Differentially Private F0 Linear Sketching

  Pagh, R. & Nielsen, N. M. S., 2021, 24th International Conference on Database Theory (ICDT 2021). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, (Leibniz International Proceedings in Informatics (LIPIcs)).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

• Fair near neighbor search via sampling

  Aumüller, M., Har-Peled, S., Mahabadi, S., Pagh, R. & Silvestri, F., 2021, I: S I G M O D Record. 50, 01

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Åben adgang

  Fil

  • Similarity Search 100%
  • Nearest Neighbor Search 100%
  • Data Structure 100%
  • Probability Theory 100%
  • Nearest Neighbor 100%

• Fine-Grained Reductions from Approximate Counting to Decision

  Dell, H. & Lapinskas, J., 2021, I: ACM Transactions on Computation Theory. 13, 2, s. 1-24 8.

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Åben adgang

  Fil

  • Approximate Counting 100%
  • Fine-grained Reductions 100%
  • Orthogonal Vector 100%
  • Negative Weight 100%
  • Approximates 100%

• Fragile Complexity of Adaptive Algorithms

  Jacob, R., Fagerberg, R., Bose, P., Cano, P., Iacono, J. & Langerman, S., 10 maj 2021, International Conference on Algorithms and Complexity. Springer, Bind LNCS 12701. s. 144-157 14 s. (LNCS, Bind 12701).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Adaptive Algorithm 100%
  • Fragile Complexity 100%
  • Minimum Element 50%
  • Algorithm Complexity 9%
  • Input Elements 9%

• Improved Differentially Private Euclidean Distance Approximation

  Nielsen, N. M. S., jun. 2021, PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Association for Computing Machinery, Bind 40. s. 42–56 56

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Differentially Private 100%
  • Differential Privacy 100%
  • Distance Approximation 100%
  • Euclidean Distance 100%
  • Gaussian Mechanism 75%

• Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths

  Curticapean, R.-C., Dell, H. & Husfeldt, T., 2021, Proceedings of the 29th Annual European Symposium on Algorithms. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Bind 204. 17 s. 34

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Polynomial Time 100%
  • Graph Matching 100%
  • K-matching 100%
  • Splittable 100%
  • Modular Counting 100%

• The role of local dimensionality measures in benchmarking nearest neighbor search

  Aumüller, M. & Ceccarello, M., 2021, I: Information Systems.

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Åben adgang

  Fil

  • Benchmarking 100%
  • Neighbour Search 100%
  • Nearest Neighbor Search 100%
  • Intrinsic Dimensionality 25%
  • Interactive Visualization 25%
• 2020

  Algorithm Engineering for High-Dimensional Similarity Search Problems (Invited Talk)

  Aumüller, M., 2020, 18th International Symposium on Experimental Algorithms (SEA 2020). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, s. 1:1–1:3 1. (Leibniz International Proceedings in Informatics (LIPIcs)).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Similarity Search 100%
  • High-dimensional Data 100%
  • Dimensional Similarity 100%
  • Search Problems 100%
  • Nearest Neighbor Search 100%

• Approximately counting and sampling small witnesses using a colourful decision oracle

  Dell, H., Lapinskas, J. & Meeks, K., 2020, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms. Chawla, S. (red.). Society for Industrial and Applied Mathematics, s. 2201-2211 11 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Oracle 100%
  • Edge 100%
  • Edge Detection 100%
  • Running Time 50%
  • Bipartite Graph 50%

• Composable Sketches for Functions of Frequencies: Beyond the Worst Case

  Cohen, E., Geri, O. & Pagh, R., 2020, Proceedings of the 37 th International Conference on Machine Learning. ML Research Press

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Machine Learning 100%
  • Learning System 100%
  • Worst Case 100%
  • Data Analytics 50%
  • Machine Learning Technique 50%

• Confirmation Sampling for Exact Nearest Neighbor Search

  Christiani, T. L., Pagh, R. & Thorup, M., 2020, SISAP 2020: Similarity Search and Applications. Springer, s. 97-110 (Lecture Notes in Computer Science, Bind 12440).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Locality Sensitive Hashing 100%
  • Exact Nearest Neighbour Search 100%
  • Neighbour Search 100%
  • Nearest Neighbor 66%
  • Data Structure 66%

• DaNewsroom: A Large-scale Danish Summarisation Dataset

  Varab, D. & Schluter, N., apr. 2020, Proceedings of the 12th Conference on Language Resources and Evaluation (LREC 2020). European Language Resources Association, s. 6731–6739

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Automatic Text Summarization 100%
  • Summarization Dataset 100%
  • Automatic Summarization 100%
  • English (Language) 100%
  • English 100%

• Differentially Private Sketches for Jaccard Similarity Estimation

  Aumüller, M., Bourgeat & Schmurr, 2020, International Conference on Similarity Search and Applications: SISAP 2020. Springer, s. 18-32 (Lecture Notest in Computer Science, Bind 12440).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Fil

  • MinHash 100%
  • Privacy-utility Tradeoff 100%
  • Differentially Private 100%
  • Similarities 100%
  • Jaccard Similarity 100%

• Fair Near Neighbor Search: Independent Range Sampling in High Dimensions. PODS

  Aumüller, M., Pagh, R. & Silvestri, F., 2020, PODS'20: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Association for Computing Machinery, s. 191–204

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Similarity Search 100%
  • High Dimension 100%
  • Nearest Neighbor Search 100%
  • Data Structure 100%
  • Nearest Neighbor 100%

• Oblivious Sketching of High-Degree Polynomial Kernels

  Ahle, T. D., Kapralov, M., Knudsen, J. B. T., Pagh, R., Velingker, A., Woodruff, D. & Zandieh, A., 2020, SODA '20: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery, 20 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Polynomial 100%
  • Matrix (Mathematics) 100%
  • Data Point 100%
  • Kernel Method 100%
  • Past Decade 100%

• On the I/O Complexity of the k-Nearest Neighbors Problem

  Goswami, M., Jacob, R. & Pagh, R., jun. 2020, PODS'20: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Association for Computing Machinery, s. 205-212 (ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • I/O-complexity 100%
  • K-nearest 100%
  • Input/Output 100%
  • Polynomial Space 100%
  • Data Structure 50%

• Private Aggregation from Fewer Anonymous Messages

  Ghazi, B., Manurangsi, P., Pagh, R. & Velingker, A., 2020, Advances in Cryptology – EUROCRYPT 2020. Springer, s. 798-827 (Lecture Notes in Computer Science, Bind 12106).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

• Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication Overhead

  Ghazi, B., Kumar, R., Manurangsi, P. & Pagh, R., 2020, Proceedings of the 37th International Conference on Machine Learning. ML Research Press

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Near-optimal 100%
  • Communication Overhead 100%
  • Differential Privacy 100%
  • Optimal Accuracy 100%
  • Trust Assumption 60%

• Pure Differentially Private Summation from Anonymous Messages

  Ghazi, B., Golowich, N., Kumar, R., Manurangsi, P., Pagh, R. & Velingker, A., 2020, 1st Conference on Information-Theoretic Cryptography (ITC 2020). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, s. 15:1–15:23 (Leibniz International Proceedings in Informatics, Bind 163).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Differentially Private 100%
  • Moment Generating Function 100%
  • Private Protocol 83%
  • Absolute Error 50%
  • Positive Integer 16%

• Reproducibility Companion Paper: Visual Sentiment Analysis for Review Images with Item-Oriented and User-Oriented CNN

  Truong, Q.-T., Lauw, H. W., Aumüller, M. & Nitta, N., 2020, MM '20: Proceedings of the 28th ACM International Conference on Multimedia. Association for Computing Machinery, s. 4444-4447

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • User-centric 100%
  • Visual Sentiment Analysis 100%
  • Reproducibility 100%
  • Sentiment Analysis 100%
  • Convolutional Neural Network 100%

• Running Experiments with Confidence and Sanity

  Aumüller, M. & Ceccarello, M., 2020, International Conference on Similarity Search and Applications. Springer, s. 18-32

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Similarity Search 100%
  • Daily Tasks 100%
  • Sanity 100%
  • Running Experiment 100%
  • Experimental Algorithmics 100%

• Space-Efficient Feature Maps for String Alignment Kernels

  Tabei, Y., Yamanishi, Y. & Pagh, R., 2020, I: Data Science and Engineering. 5, s. 168–179

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Åben adgang

  Fil

  • Feature Map 100%
  • Efficient Features 100%
  • String Alignment Kernels 100%
  • Fourier Feature 100%
  • Random Fourier Features 33%

• The space complexity of inner product filters

  Pagh, R. & Sivertsen, J. V. T., 2020, 23rd International Conference on Database Theory (ICDT 2020). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, s. 22:1–22:14 (Leibniz International Proceedings in Informatics (LIPIcs), Bind 155).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Inner Product 100%
  • Complexity Space 100%
  • Space Complexity 100%
  • Dimensionality Reduction 100%
  • Upper Bound 40%

• WOR and p’s: Sketches for Lp-sampling Without Replacement

  Cohen, E., Pagh, R. & Woodruff, D., 2020, 34th Conference on Neural Information Processing Systems (NeurIPS 2020). Neural Information Processing Systems

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil
• 2019

  A Fixed-Parameter Perspective on #BIS

  Curticapean, R.-C., Dell, H., Fomin, F., Goldberg, L. A. & Lapinskas, J., 18 jul. 2019, I: Algorithmica. 81, 10, s. 3844–3864

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Åben adgang

  Fil

  • Fixed Parameter 100%
  • #BIS 100%
  • Independent Set 100%
  • NP-hard 75%
  • Approximates 75%

• ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms

  Aumüller, M., Bernhardsson, E. & Faithfull, A., 2019, I: Information Systems.

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Åben adgang

  Fil

  • Approximate Nearest Neighbor Search 100%
  • Benchmarking Tools 100%
  • K-nearest Neighbor (K-NN) 100%
  • Benchmarking 100%
  • Artificial Neural Network 100%

• Benchmarking Nearest Neighbor Search: Influence of Local Intrinsic Dimensionality and Result Diversity in Real-World Datasets

  Aumüller, M. & Ceccarello, M., 2019, EDML 2019 - Evaluation and Experimental Design in Data Mining and Machine Learning. CEUR Workshop Proceedings, Bind 2436. (CEUR Workshop Proceedings, Bind 2436).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Nearest Neighbor Search 100%
  • Local Intrinsic Dimensionality 100%
  • Benchmarking 100%
  • Intrinsic Dimensionality 100%
  • Neighbour Search 100%

• Dynamic Planar Convex Hull

  Jacob, R. & Brodal, G., 28 feb. 2019, 87 s.

  Publikation: Working paper › Forskning

  Åben adgang

  • Convex Hull 100%
  • Data Structure 100%
  • Extreme Points 40%
  • Computational Complexity 25%
  • Space Use 25%

• External memory priority queues with decrease-key and applications to graph algorithms

  Iacono, J., Jacob, R. & Tsakalidis, K., 7 mar. 2019, I: Leibniz International Proceedings in Informatics. s. 60:1–60:14 60.

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Konferenceartikel › Forskning › peer review

  Åben adgang

  Fil

  • Priority Queue 100%
  • External Memory 100%
  • Graph Algorithms 100%
  • Frac-N 100%
  • E-Value 100%

• 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 sep. 2019, 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, s. 2:1–2:19 2. (Leibniz International Proceedings in Informatics (LIPIcs)).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Fragile Complexity 100%
  • Algorithm Comparison 100%
  • Comparator 100%
  • Computational Complexity 50%
  • Maximal Number 50%

• 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, Bind 144. s. 80:1–80:13 13 s. 80. (Leibniz International Proceedings in Informatics).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Jaccard Similarity 100%
  • Bichromatic Closest Pair 100%
  • Locality Sensitive Hashing 40%
  • Omega-1 40%
  • Similarity Measure 33%

• 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

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Oblivious Data Structure 100%
  • Data Structure 100%
  • Search Tree 66%
  • Priority Queue 66%
  • Black Box 33%

• 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 . Bind 97. s. 4413-4423

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Deep Generative Modeling 100%
  • Incomplete Data 100%
  • Single Imputation 50%
  • Importance Weighted Autoencoder 50%
  • State-of-the-art Techniques 25%

• 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 fuer Informatik GmbH, s. 8:1-8:20 20 s. (Leibniz International Proceedings in Informatics (LIPIcs)).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Integer 100%
  • Key Difference 100%
  • Computable Function 100%
  • Kernelization 100%
  • Streaming Algorithms 100%

• 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. Bind 97. s. 6798-6807

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Architecture for Learning 100%
  • Approximate Bayesian Computation 100%
  • Exchange Networks 100%
  • Summary Statistic 100%
  • Markov Process 33%

• 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, s. 1-16 16 s. 10

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Nearest Neighbor 100%
  • Parameter-free 100%
  • Neighbour Search 100%
  • Nearest Neighbor Search 66%
  • Perform Experiment 50%

• 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, Bind Volume 1 (Long and Short Papers). s. 251-260 10 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Recurrent Model 100%
  • Maximum Spanning Tree 100%
  • Syntactics 100%
  • Spanning Tree 100%
  • Graph-based 50%

• Similarity Search: Algorithms for Sets and other High Dimensional Data

  Ahle, T. D., 2019, IT University of Copenhagen. 158 s.

  Publikation: Afhandlinger › Ph.d.-afhandling

  Åben adgang

  Fil

  • Similarity Search 100%
  • Locality Sensitive Hashing 100%
  • High-dimensional Data 100%
  • Search Algorithm 100%
  • Data Structure 100%

• 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 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Partitioning Scheme 100%
  • Sorting Algorithm 100%
  • Quicksort 100%
  • Robust Algorithm 100%
  • Quick Sort 33%