„partitioning algorithm“

Suchergebnisse

258 Treffer

• Planted Models for k-Way Edge and Vertex Expansion
  Louis, Anand ; Venkat, Rakesh 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
  Gottesbüren, Lars ; Hamann, Michael ; Wagner, Dorothea 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
  Agarwal, Pankaj K. ; Aronov, Boris ; Ezra, Esther ; Zahl, Joshua 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm
  Ficker, Annette M. C. ; Erlebach, Thomas ; Mihalák, Matús ; Spieksma, Frits C. R. 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Balanced Connected Partitioning of Unweighted Grid Graphs
  Berenger, Cedric ; Niebert, Peter ; Perrot, Kevin 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams
  Nakahata, Yu ; Kawahara, Jun ; Kasahara, Shoji 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Aggregative Coarsening for Multilevel Hypergraph Partitioning
  Shaydulin, Ruslan ; Safro, Ilya 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
  Bliznets, Ivan ; Karpov, Nikolai 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure
  Heuer, Tobias ; Schlag, Sebastian 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximate Clustering via Metric Partitioning
  Bandyapadhyay, Sayan ; Varadarajan, Kasturi 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Streaming Partitioning of Sequences and Trees
  Konrad, Christian 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Approximation Algorithms for Balanced Partitioning Problems
  Räcke, Harald ; Stotz, Richard 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Colour Refinement: A Simple Partitioning Algorithm with Applications From Graph Isomorphism Testing to Machine Learning (Invited Talk)
  Grohe, Martin 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481)
  Chudnovsky, Maria ; Misra, Neeldhara ; Paulusma, Daniel ; Schaudt, Oliver ; Agrawal, Akanksha
• Data Consistency in Distributed Systems: Algorithms, Programs, and Databases (Dagstuhl Seminar 18091)
  Bieniusa, Annette ; Gotsman, Alexey ; Kemme, Bettina ; Shapiro, Marc
• Multi-Level Refinement Algorithm of Weighted Hypergraph Partitioning Problem
  Leng, Ming ; Sun, Ling-yu ; Guo, Kai-qiang
• Algorithms for partitioning of large routing networks
  Awasthi, A. ; Chauhan, S S. ; Parent, M. ; Proth, Jean-Marie
• Pattern Recognition – An Algorithmic Approach
  Narasimha Murty, M. ; Devi, V. Susheela 2011 Springer London
• Transactions on Large-Scale Data- and Knowledge-Centered Systems XLII
  2019 Springer International Publishing
• On Packing and Partitioning Problems with Applications to DRAM Allocation
  Natale, Marco Vincenzo 2019 Dr. Hut