The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
d Abstract) Friedhelm Meyer auf der Heide Berthold V¨ocking† Matthias Westermann We present a general framework for the development of online algorithms for data manageme...
The mobile communication industry has experienced huge growth in recent years, which amplified the competition among telecommunication companies. This inspired the search for new ...