—In our previous work [11], we derived detection delay and detection probability for a randomized scheduling algorithm in wireless sensor networks. In this paper, we study asympt...
Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic fl...
- In this paper we investigate mixture of experts problems in the context of Local-Global Neural Networks. This type of architecture was originaly conceived for functional approxim...
In the past, new global illumination algorithms have usually been designed as a single module that was responsible for the simulation of all aspects of illumination in a scene. A ...
Philipp Slusallek, Marc Stamminger, Hans-Peter Sei...
The assessment of routing protocols for wireless networks is a difficult task, because of the networks’ highly dynamic behavior and the absence of benchmarks. However, some of ...