1528 search results - page 118 / 306 » On Signatures for Communication Graphs |
176
click to vote
AUTOMATICA
2011
15 years 1 months ago
2011
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
186
click to vote
PPOPP
2009
ACM
16 years 6 months ago
2009
ACM
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
177
click to vote
CCS
2007
ACM
16 years 10 days ago
2007
ACM
In measuring the overall security of a network, a crucial issue is to correctly compose the measure of individual components. Incorrect compositions may lead to misleading results...
135
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
176
click to vote
GD
2001
Springer
15 years 10 months ago
2001
Springer
In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which...