Fakultäten der Universität Bonn: Suche
Anzeige der Dokumente 1-10 von 15
In Silico Facets of Biochemical Research: Accounts from Protein Folding and Protein-Ligand Interaction Studies
(2020-09-04)
Exponential advancements in computer technology over the last five decades have ubiquitously benefited science and humanity as a whole. Consequent beneficiaries of this surge of computational power include all subfields ......
Sparse Grid Methods for Higher Dimensional Approximation
(2010-09-10)
Diese Arbeit befasst sich mit Dünngitterverfahren zur Lösung von höherdimensionalen Problemen. Sie zeigt drei neue Aspekte von Dünnen Gittern auf: Erweiterungen der elementaren Werkzeuge zur Arbeit mit Dünnen Gittern, eine ...
Numerische Simulation der Interaktion von inkompressiblen Zweiphasenströmungen mit Starrkörpern in drei Raumdimensionen
(2010-09-30)
In dieser Arbeit stellen wir erstmalig einen parallelen Löser für inkompressible Zweiphasenströmungen mit Oberflächenspannung in drei Raumdimensionen vor, der Masseerhaltung und hohe Konvergenzordnung vereint. Als zweite ...
Migration of interneuronal precursor cells in the developing cerebellum of mice: model-based cell tracking and simulation
(2010-12-10)
The navigation of precursor cells of inhibitory interneurons from their germinal zone inside the fourth ventricle through the white matter towards their final destination within the cerebellum's molecular layer is an ongoing ...
Fast Resource Sharing in VLSI Routing
(2010-02-04)
Routing is the last major step in chip design. It naturally splits into global and detailed routing: In global routing, an approximate layout of electrical connections is computed, subject to constraints on ...
Geometric Dilation and Halving Distance
(2008)
Let us consider the network of streets of a city represented by a geometric graph G in the plane. The vertices of G represent the crossroads and the edges represent the streets. The latter do not have to be straight line ...
Approximation Complexity of Optimization Problems: Structural Foundations and Steiner Tree Problems
(2004)
In this thesis we study the approximation complexity of the Steiner Tree Problem and related problems as well as foundations in structural complexity theory. The Steiner Tree Problem is one of the most fundamental problems ...
Transistor-Level Layout of Integrated Circuits
(2014-07-29)
In this dissertation, we present the toolchain BonnCell and its underlying algorithms. It has been developed in close cooperation with the IBM Corporation and automatically generates the geometry for functional groups of ...
Five Essays in Economic Theory
(2014-10-30)
This thesis covers two main areas of microeconomic theory. The first three chapters are contributions to the theory of mechanism design and the last two chapters contribute to the literature on general equilibrium in markets ...
Robust Wide-Baseline Stereo Matching for Sparsely Textured Scenes
(2013)
The task of wide baseline stereo matching algorithms is to identify corresponding elements in pairs of overlapping images taken from significantly different viewpoints. Such algorithms are a key ingredient to many computer ...