E-Dissertationen: Search
Now showing items 31-40 of 172
JINC - A Multi-Threaded Library for Higher-Order Weighted Decision Diagram Manipulation
(2010-11-16)
Ordered Binary Decision Diagrams (OBDDs) have been proven to be an efficient data structure for symbolic algorithms. The efficiency of the symbolic methods de- pends on the underlying OBDD library. Available OBDD libraries ...
Learning to Predict Combinatorial Structures
(2010-07-07)
The major challenge in designing a discriminative learning algorithm for predicting structured data is to address the computational issues arising from the exponential size of the output space. Existing algorithms make ...
Modeling Linearly and non-Linearly Dependent Simulation Input Data
(2010-08-04)
Input modeling software tries to fit standard probability distributions to data assuming that the data are independent. However, the input environment can generate correlated data. Ignoring the correlations might lead to ...
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 ...
Efficient Point-Cloud Processing with Primitive Shapes
(2010-12-21)
This thesis presents methods for efficient processing of point-clouds based on primitive shapes. The set of considered simple parametric shapes consists of planes, spheres, cylinders, cones and tori. The algorithms developed ...
Virtual compound screening and SAR analysis: method development and practical applications in the design of new serine and cysteine protease inhibitors
(2010-11-05)
Virtual screening is an important tool in drug discovery that uses different computational methods to screen chemical databases for the identification of possible drug candidates. Most virtual screening methodologies are ...
Efficient Methods for Continuous and Discrete Shape Analysis
(2010-11-17)
When interpreting an image of a given object, humans are able to abstract from the presented color information in order to really see the presented object. This abstraction is also known as shape. The concept of shape is ...
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 ...
Algorithmen für Matchingprobleme in speziellen Graphklassen
(2010-03-02)
Das Matching- oder Korrespondenzproblem gehört zum Gebiet der Graphentheorie. Zielsetzung ist es, in einem Graphen mit n Knoten und m Kanten effizient ein maximales Matching, d.h. eine möglichst große Menge disjunkter ...
Methods for Real-time Visualization and Interaction with Landforms
(2010-03-03)
This thesis presents methods to enrich data modeling and analysis in the geoscience domain with a particular focus on geomorphological applications. First, a short overview of the relevant characteristics of the used remote ...