„Partitioning algorithms“

Suchergebnisse

1.000+ Treffer

• Metabolic modeling of a chronic wound biofilm consortium predicts spatial partitioning of bacterial species
  Phalak, Poonam ; Chen, Jin ; Carlson, Ross P. ; Henson, Michael A.
• Partitioning Algorithms and Combined Model Integration for Data Mining
  Conversano, Claudio ; Mola, Francesco ; Siciliano, Roberta
• Transactions on Large-Scale Data- and Knowledge-Centered Systems XXIX
  Hameurlain, Abdelkader ; Küng, Josef ; Wagner, Roland 2016 Springer Berlin Heidelberg
• Transactions on Large-Scale Data- and Knowledge-Centered Systems XXVI – Special Issue on Data Warehousing and Knowledge Discovery
  Hameurlain, Abdelkader ; Küng, Josef ; Wagner, Roland ; Bellatreche, Ladjel ; Mohania, Mukesh 2016 Springer International Publishing
• Partitioning of functional gene expression data using principal points
  Kim, Jaehee ; Kim, Haseong
• An improved mixture of experts approach for model partitioning in VLSI design – using genetic algorithms
  Hering, Klaus ; Haupt, Reiner ; Villmann, Thomas 1995 Inst. für Informatik
• Transactions on Large-Scale Data- and Knowledge-Centered Systems LII
  Hameurlain, Abdelkader ; Tjoa, A Min 2022 Springer Berlin
• Parallel and Flow-Based High Quality Hypergraph Partitioning
  Gottesbüren, Lars ; Wagner, Dorothea ; Meyerhenke, Henning 2023 KIT-Bibliothek
• Scalable High-Quality Graph and Hypergraph Partitioning
  Heuer, Tobias ; Sanders, Peter ; Çatalyürek, Ümit 2022 KIT-Bibliothek
• Parallel and External High Quality Graph Partitioning
  Akhremtsev, Yaroslav ; Sanders, P. 2019 KIT-Bibliothek
• High-Performance Graph Algorithms
  Looz, Moritz ˜vonœ ; Meyerhenke, H. 2019 KIT-Bibliothek
• Algorithms for the Dynamic Balanced Graph Partitioning Problem
  Zabrodin, Ruslan Andreevic ; Räcke, Harald ; Bieńkowski, Marcin 2025 Universitätsbibliothek der TU München
• Geometric and Combinatorial Problems of Matching and Partitioning in Theoretical Computer Science
  Miltzow, Tillmann 2015 Freie Universität Berlin
• High Quality Graph Partitioning
  Schulz, Christian ; Sanders, P. 2013 KIT-Bibliothek
• Efficient Polynomial-Time Algorithms for Special Graph Partitioning Problems
  Pardella, Gregor L. 2011 Verlag Dr. Hut
• New contributions to spatial partitioning and parallel global illumination algorithms
  Garmann, Robert
• Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
  Sensen, Norbert
• Topology-aware optimization of big sparse matrices and matrix multiplications on main-memory systems
  Lehner, Wolfgang ; Kernert, David ; Köhler, Frank 2023 Technische Universität Dresden
• Adaptive Index Buffer
  Lehner, Wolfgang ; Voigt, Hannes ; Jaekel, Tobias ; Kissinger, Thomas 2022 Technische Universität Dresden
• Processing reporting function views in a data warehouse environment
  Lehner, Wolfgang ; Hummer, W. ; Schlesinger, L. 2022 Technische Universität Dresden