534 search results - page 58 / 107 » Diameter critical graphs |
110
click to vote
DBSEC
2008
15 years 4 days ago
2008
To protect critical resources in today’s networked environments, it is desirable to quantify the likelihood of potential multi-step attacks that combine multiple vulnerabilities....
84
Voted
ICIP
2007
IEEE
15 years 5 months ago
2007
IEEE
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
EJC
2007
14 years 11 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n ...
AGTIVE
2007
Springer
15 years 5 months ago
2007
Springer
In collaborative ontology engineering, contexts are key to manage the complexity of different dependency types between ontological artefacts. Instead of being frustrated by out-of...
109
click to vote
ASPDAC
1999
ACM
15 years 3 months ago
1999
ACM
: This paper presents a genetic algorithm based approach for algebraic optimization of behavioral system specifications. We introduce a chromosomal representation of data-flow gr...