49 search results - page 2 / 10 » On Fast and Approximate Attack Tree Computations |
CGF
2008
13 years 5 months ago
2008
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
EOR
2008
13 years 5 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
MUE
2009
IEEE
14 years 2 days ago
2009
IEEE
As modern life becomes increasingly closely bound to the Internet, network security becomes increasingly important. Like it or not, we all live under the shadow of network threats...
STACS
1999
Springer
13 years 9 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
JCNS
2010
13 years 4 days ago
2010
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...