Sciweavers

1172 search results - page 8 / 235
» Path Algorithms on Regular Graphs
Sort
View
JNSM
2008
93views more  JNSM 2008»
13 years 7 months ago
Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
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...
Steven Noel, Sushil Jajodia
CIKM
2007
Springer
14 years 1 months ago
Towards practically feasible answering of regular path queries in lav data integration
Regular path queries (RPQ’s) are given by means of regular expressions and ask for matching patterns on labeled graphs. RPQ’s have received great attention in the context of s...
Manuel Tamashiro, Alex Thomo, Srinivasan Venkatesh
CAAN
2007
Springer
14 years 1 months ago
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
Margaret-Ellen Messinger, Pawel Pralat, Richard J....
NIPS
2004
13 years 9 months ago
Following Curved Regularized Optimization Solution Paths
Regularization plays a central role in the analysis of modern data, where non-regularized fitting is likely to lead to over-fitted models, useless for both prediction and interpre...
Saharon Rosset
DAM
2011
13 years 2 months ago
Powers of cycles, powers of paths, and distance graphs
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
Min Chih Lin, Dieter Rautenbach, Francisco J. Soul...