2473 search results - page 188 / 495 » The Logic of Communication Graphs |
161
Voted
PPOPP
2009
ACM
16 years 4 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...
145
click to vote
CCS
2007
ACM
15 years 10 months 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...
108
click to vote
WG
2004
Springer
15 years 9 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...
153
click to vote
GD
2001
Springer
15 years 8 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...
129
Voted
DSN
2000
IEEE
15 years 8 months ago
2000
IEEE
In this paper, we propose new scheduling algorithms to achieve fault security in multiprocessor systems. We consider scheduling of parallel programs represented by directed acycli...