4009 search results - page 447 / 802 » Clustering on Complex Graphs |
193
click to vote
ACSAC
2005
IEEE
16 years 13 days ago
2005
IEEE
The typical means by which an attacker breaks into a network is through a chain of exploits, where each exploit in the chain lays the groundwork for subsequent exploits. Such a ch...
178
click to vote
ISAAC
2005
Springer
16 years 9 days ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
177
click to vote
ISCAS
2003
IEEE
16 years 2 days ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
163
click to vote
TOOLS
2010
IEEE
15 years 11 months ago
2010
IEEE
Supporting read-only and side effect free execution has been the focus of a large body of work in the area of statically typed programming languages. Read-onlyness in dynamically t...
184
click to vote
ICECCS
1997
IEEE
15 years 11 months ago
1997
IEEE
Software architectures can play a role in improving the testing process of complex systems. In particular, descriptions of the software architecture can be useful to drive integra...