Sciweavers

3532 search results - page 356 / 707
» Overlay networks with class
Sort
View
ICDT
2012
ACM
242views Database» more  ICDT 2012»
13 years 9 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher
FOCS
1995
IEEE
15 years 10 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
DFG
2009
Springer
16 years 1 months ago
Group-Level Analysis and Visualization of Social Networks
Social network analysis investigates the structure of relations amongst social actors. A general approach to detect patterns of interaction and to filter out irregularities is to ...
Michael Baur, Ulrik Brandes, Jürgen Lerner, D...
ICC
2009
IEEE
239views Communications» more  ICC 2009»
16 years 1 months ago
An Analytical Approach for Throughput Evaluation of Wireless Network Coding
In this paper, we propose a new analytical model for throughput evaluation of wireless network coding. This new approach is based on a probabilistic viewpoint on network coding, i....
Mohammad H. Amerimehr, Farid Ashtiani, Mohammad Ba...
AIMS
2009
Springer
16 years 1 months ago
Visualization of Node Interaction Dynamics in Network Traces
The analysis of network traces often requires to find the spots where something interesting happens. Since traces are usually very large data-sets, it is often not easy and time i...
Petar Dobrev, Sorin Stancu-Mara, Jürgen Sch&o...