1986 search results - page 124 / 398 » Path Separability of Graphs |
JNSM
2008
13 years 9 months ago
2008
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
IJVR
2008
13 years 9 months ago
2008
Augmented Reality (AR) enables users to visualize synthetic information overlaid on a real video stream. Such visualization is achieved by tools that vary depending on the underlyi...
DAM
2007
13 years 9 months ago
2007
Given a graph G = (V, E) with a cost function c(S) ≥ 0 ∀S ⊆ V , we want to represent all possible min-cut values between pairs of vertices i and j. We consider also the spec...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...
ICRA
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract— This paper revisits the multi-robot boundary coverage problem in which a group of k robots must inspect every point on the boundary of a 2-dimensional environment. We f...