Sciweavers

638 search results - page 31 / 128
» Competitive contagion in networks
Sort
View
CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
14 years 21 days ago
Network Discovery and Verification with Distance Queries
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 ...
ESA
1999
Springer
105views Algorithms» more  ESA 1999»
14 years 1 months ago
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks
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...
Friedhelm Meyer auf der Heide, Berthold Vöcki...
ICANN
2010
Springer
13 years 9 months ago
Tumble Tree - Reducing Complexity of the Growing Cells Approach
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...
Hendrik Annuth, Christian-A. Bohn
GI
1999
Springer
14 years 1 months ago
Caching in Networks
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...
Matthias Westermann
CONEXT
2007
ACM
14 years 27 days ago
Can active tracking of inroamer location optimise a live GSM network?
The mobile communication industry has experienced huge growth in recent years, which amplified the competition among telecommunication companies. This inspired the search for new ...
Katerina Dufková, Jirí Danihelka, Mi...