Sökning: "partitioning algorithms"

Visar resultat 1 - 5 av 48 avhandlingar innehållade orden partitioning algorithms.

1. 1. Graph Partitioning and Planted Partitions

   Författare :Mikael Onsjö; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; planted partition; graph bisection; algorithms; graphs; graph partitioning; clustering;

   Sammanfattning : Graph partitioning is the problem of splitting a graph into two or morepartitions of fixed sizes while minimizing the number of edges that are “cut”.This is an important problem with a wide range of applications in fields suchas VLSI design, parallel processing, bioinformatics, data mining etc. LÄS MER

3. 2. Studies in Efficient Discrete Algorithms

   Författare :DZMITRY SLEDNEU; Matematik (naturvetenskapliga fakulteten); []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Algorithms; Approximation algorithms; Graphs;

   Sammanfattning : This thesis consists of five papers within the design and analysis of efficient algorithms.In the first paper, we consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. We develop a combinatorial randomized algorithm that runs in subcubic time for a special class of graphs. LÄS MER

4. 3. Exact and approximation algorithms for graph problems with some biological applications

   Författare :Eva-Marta Lundell; Data Vetenskap; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Graph algorithms; computational biology; approximation algorithms; computational complexity; evolutionary trees; maximum agreement subtree; graph embedding; shortest cycle; clique partitioning;

   Sammanfattning : In this thesis we study several combinatorial problems in algorithmic graph theory and computational biology, and different algorithmical approaches for solving them. In particular, we focus on graph algorithms, seeking for the most part polynomial or sub-exponential exact solutions, but in some cases also approximate solutions. LÄS MER

5. 4. Efficient Partitioning of Dynamic Structured Grid Hierarchies

   Författare :Johan Steensland; Michael Thuné; Jarmo Rantakokko; Charles Norton; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; scientific computing; partitioning; structured grids; adaptive mesh refinement; dynamic load balancing; Beräkningsvetenskap; Scientific Computing;

   Sammanfattning : This thesis aims at decreasing execution time for large-scale structured adaptive mesh refinement (SAMR) applications executing on general parallel computers. The key contributions are (1) A conceptual dynamically adaptive meta-partitioner able to select and configure an appropriate partitioning technique, based on application and computer state, and (2) A characterization of new and existing domain-based partitioners, enabling a mapping from application and computer state onto appropriate partitioners, and (3) Sketched scalable solutions, expressed in terms of natural regions and expert algorithms, for the problem to efficiently partition large-scale SAMR applications with deep grid hierarchies executing on general parallel computers, and (4) A software partitioning tool Nature+Fable, implementing the greater parts of these sketched scalable solutions and engineered as part of the meta-partitioner. LÄS MER

7. 5. Drug Partitioning into Natural and Artificial Membranes : Data Applicable in Predictions of Drug Absorption

   Författare :Caroline Engvall; Birgitta Tomkinson; Katarina Edwards; Sven Engström; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Biochemistry; Bilayer disk; Cholesterol; Drug partitioning; Drugs; Electrostatic effects; Immobilized liposome chromatography; Liposome; Membrane protein; Model membrane; Oligonucleotide-liposome complex; Phospholipid; Phospholipid bilayer; Proteoliposome; Surfactant; Biokemi; Biochemistry; Biokemi;

   Sammanfattning : When drug molecules are passively absorbed through the cell membrane in the small intestine, the first key step is partitioning of the drug into the membrane. Partition data can therefore be used to predict drug absorption. LÄS MER