2304 search results - page 242 / 461 » On the Vulnerability of Large Graphs |
186
click to vote
DSN
2005
IEEE
16 years 8 days ago
2005
IEEE
Distributed systems with multiple interacting services, such as distributed e-commerce systems, are suitable targets for malicious attacks because of the potential financial impac...
155
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
180
click to vote
FPGA
1998
ACM
15 years 11 months ago
1998
ACM
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
183
click to vote
CAV
2010
Springer
2010
Springer
Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs
15 years 8 months ago
Triggering errors in concurrent programs is a notoriously difficult task. A key reason for this is the behavioral complexity resulting from the large number of interleavings of op...
192
click to vote
BIOCOMP
2008
15 years 8 months ago
2008
We introduce a novel parameter called container flux, which is used to measure the information sharing capacity between two distinct nodes in a graph. Other useful information, bot...