Sciweavers

2304 search results - page 26 / 461
» On the Vulnerability of Large Graphs
Sort
View
IFIP
2007
Springer
14 years 3 months ago
Insider Threat Analysis Using Information-Centric Modeling
Capability acquisition graphs (CAGs) provide a powerful framework for modeling insider threats, network attacks and system vulnerabilities. However, CAG-based security modeling sys...
Duc T. Ha, Shambhu J. Upadhyaya, Hung Q. Ngo, S. P...
NDSS
2009
IEEE
14 years 4 months ago
Analyzing and Comparing the Protection Quality of Security Enhanced Operating Systems
Host compromise is a serious computer security problem today. To better protect hosts, several Mandatory Access Control systems, such as Security Enhanced Linux (SELinux) and AppA...
Hong Chen, Ninghui Li, Ziqing Mao
RELMICS
2000
Springer
14 years 1 months ago
A Relational View of Subgraph Isomorphism
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, ...
Jordi Cortadella, Gabriel Valiente
EDBT
2006
ACM
174views Database» more  EDBT 2006»
14 years 9 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
SC
2009
ACM
14 years 4 months ago
Evaluating use of data flow systems for large graph analysis
Large graph analysis has become increasingly important and is widely used in many applications such as web mining, social network analysis, biology, and information retrieval. The...
Andy Yoo, Ian Kaplan