534 search results - page 58 / 107 » Diameter critical graphs |
186
click to vote
DBSEC
2008
15 years 7 months 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....
149
click to vote
ICIP
2007
IEEE
16 years 18 days 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...
142
click to vote
EJC
2007
15 years 6 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 ...
181
click to vote
AGTIVE
2007
Springer
16 years 14 days 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...
173
click to vote
ASPDAC
1999
ACM
15 years 10 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...