4435 search results - page 298 / 887 » Networking named content |
157
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the d...
123
click to vote
JCT
2011
15 years 1 months ago
2011
We prove a strong version of the the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are “orthogonal” to e...
162
click to vote
IJACT
2010
15 years 1 months ago
2010
: We study the interplay of network connectivity and the issues related to the `possibility', `feasibility' and `optimality' for unconditionally reliable message tra...
229
click to vote
JMLR
2012
13 years 9 months ago
2012
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
182
click to vote
ICC
2008
IEEE
16 years 1 months ago
2008
IEEE
— The connected dominating set (CDS) has been extensively used for routing and broadcast in mobile ad hoc networks. While existing CDS protocols are successful in constructing CD...