87 search results - page 10 / 18 » Breaking the rhythm on graphs |
DSN
2011
IEEE
13 years 11 months ago
2011
IEEE
— This paper describes a modeling framework for evaluating the impact of faults on the output of streaming ions. Our model is based on three abstractions: stream operators, strea...
122
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
IWPEC
2009
Springer
15 years 5 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
133
click to vote
IACR
2011
13 years 11 months ago
2011
We introduce a new concept in splice-and-cut attacks on hash functions, which bridges the gap between preimage attacks and a powerful method of differential cryptanalysis. The ne...
102
click to vote
ACSAC
2005
IEEE
15 years 4 months ago
2005
IEEE
The typical means by which an attacker breaks into a network is through a chain of exploits, where each exploit in the chain lays the groundwork for subsequent exploits. Such a ch...