#### Filter Results:

#### Publication Year

2012

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We extend the Stochastic Subscriber Line Model by the introduction of shortest-path trees which are obtained by splitting up the segment system of the typical serving zone at its crossings and endings. Due to reasons in the complex field of cost and capacity estimation in telecommunication networks, it is desirable to gain knowledge about distributional… (More)

- David Neuhäuser, Christian Hirsch, Catherine Gloaguen, Volker Schmidt
- Annales des Télécommunications
- 2015

Shortest-path trees play an important role in the field of optimising fixed-access telecommunication networks with respect to costs and capacities. Dis-tributional properties of the corresponding two half-trees originating from the root of such a tree are of special interest for engineers. In the present paper, we derive parametric approximation formulas… (More)

- David Neuhäuser, Christian Hirsch, Catherine Gloaguen, Volker Schmidt
- Queueing Syst.
- 2012

- DAVID NEUHÄUSER
- 2015

We provide a parametric modelling approach suitable for various kinds of hierarchical networks based on random geometric graphs. In these networks, we have two kinds of components, so-called high-level components (HLC) and low-level components (LLC). Each HLC is associated with a serving zone and all LLC within this area are connected to the corresponding… (More)

- H. Martin Bücker, Ralf Seidler, David Neuhäuser, Tobias Beier
- 2015 IEEE 9th International Symposium on Embedded…
- 2015

The Open Computing Language (OpenCL) is designed to provide a platform-independent specification for programming heterogenous computing systems. The performance of an OpenCL program, however, is not easily transferrable from one platform to another. Auto-tuning is among the techniques that address this situation by automating the performance optimization of… (More)

- M. Ali Rostami, H. Martin Bücker, Christian Vogt, Ralf Seidler, David Neuhäuser, Volker Rath
- 2014 16th International Symposium on Symbolic and…
- 2014

Inverse problems arise in various areas of science and engineering. These problems are not only difficult to solve numerically, but they also require a large amount of computer resources both in time and memory. It is therefore not surprising that inverse problems are often solved using techniques from high-performance computing. We consider the… (More)

- Ralf Seidler, H. Martin Bücker, M. Ali Rostami, David Neuhäuser
- 2014 9th International Conference on Software…
- 2014

Mathematical optimization algorithms are ubiquitous in computational science and engineering where the objective function of the optimization problem involves a complicated computer model predicting relevant phenomena of a scientific or engineering system of interest. Therefore, in this area of mathematical software, it is indispensable to combine software… (More)

- David Neuhäuser, Eberhard Zehendner
- ARCS Workshops
- 2012

When arithmetic components are parallelized, fault-prone interconnections can tamper results significantly.A dvances in feature size shrinking lead to as teady increase of errors caused by faulty transmission. We suggest to employresilient data encoding schemes to offset these negative effects. Focusing on parallel signed-digit based arithmetic, frequently… (More)

- David Neuhäuser, Eberhard Zehendner
- ARCS Workshops
- 2012

When arithmetic components are parallelized, fault-prone interconnections can tamper results significantly.C onstantly progressing technology scaling leads to as teady increase of errors caused by faulty transmission. Resilient data encoding schemes can be used to offset these negative effects. Focusing on parallel signed-digit based arithmetic frequently… (More)

Distributional properties and a simulation algorithm for the Palm version of stationary iterated tessellations are considered. In particular we study the limit behavior of functionals related to Cox-Voronoi cells (such as typical shortest path lengths) if either the intensity γ0 of the initial tessellation or the intensity γ1 of the component tessellation… (More)