Sciweavers

1986 search results - page 217 / 398
» Path Separability of Graphs
Sort
View
ALGOSENSORS
2009
Springer
15 years 9 months ago
Approximating Barrier Resilience in Wireless Sensor Networks
Barrier coverage in a sensor network has the goal of ensuring that all paths through the surveillance domain joining points in some start region S to some target region T will inte...
Sergey Bereg, David G. Kirkpatrick
132
Voted
CSFW
2007
IEEE
15 years 8 months ago
Creating Vulnerability Signatures Using Weakest Preconditions
Signature-based tools such as network intrusion detection systems are widely used to protect critical systems. Automatic signature generation techniques are needed to enable these...
David Brumley, Hao Wang, Somesh Jha, Dawn Xiaodong...
AINA
2006
IEEE
15 years 6 months ago
EQ-BGP: an efficient inter-domain QoS routing protocol
In this paper we propose the Enhanced QoS Border Gateway Protocol1 (EQ-BGP) aimed at performing the inter-domain QoS routing in a multi-domain IP network. The objective of EQ-BGP ...
Andrzej Beben
115
Voted
SAC
2009
ACM
15 years 9 months ago
Visualization of clustered directed acyclic graphs with node interleaving
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
Pushpa Kumar, Kang Zhang
206
Voted
OA
1989
237views Algorithms» more  OA 1989»
15 years 6 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph