Sciweavers

1028 search results - page 72 / 206
» Using Attack Graphs to Design Systems
Sort
View
NOMS
2002
IEEE
130views Communications» more  NOMS 2002»
14 years 3 months ago
End-to-end service failure diagnosis using belief networks
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
Malgorzata Steinder, Adarshpal S. Sethi
USS
2008
14 years 22 days ago
You Go to Elections with the Voting System You Have: Stop-Gap Mitigations for Deployed Voting Systems
In light of the systemic vulnerabilities uncovered by recent reviews of deployed e-voting systems, the surest way to secure the voting process would be to scrap the existing syste...
J. Alex Halderman, Eric Rescorla, Hovav Shacham, D...
PCI
2005
Springer
14 years 3 months ago
Scenario Networks: Specifying User Interfaces with Extended Use Cases
In this paper, we present the rationale and the baseline of a notation which can be used on its own or as an extension to standard UML to facilitate specification of an interactive...
Demosthenes Akoumianakis, Ioannis Pachoulakis
ISCAS
2003
IEEE
116views Hardware» more  ISCAS 2003»
14 years 3 months ago
Using FPGAs to solve the Hamiltonian cycle problem
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
Micaela Serra, Kenneth B. Kent
ISPA
2004
Springer
14 years 3 months ago
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...
Changtao Qu, Wolfgang Nejdl, Matthias Kriesell