2304 search results - page 27 / 461 » On the Vulnerability of Large Graphs |
104
click to vote
CIKM
2007
Springer
15 years 6 months ago
2007
Springer
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
ARSCOM
2006
14 years 12 months ago
2006
MacGillivray and Seyffarth (J. Graph Theory 22 (1996), 213
106
click to vote
SIAMCOMP
2011
14 years 6 months ago
2011
Reingold, Vadhan and Wigderson [21] introduced the graph zig-zag product. This product combines a large graph and a small graph into one graph, such that the resulting graph inher...
ICSE
2007
IEEE-ACM
15 years 12 months ago
2007
IEEE-ACM
er abstract summarizes the Threat Modeling method based on Attacking Path Analysis (T-MAP) which quantifies and prioritizes security threats by calculating the total severity weig...
DFT
2005
IEEE
15 years 5 months ago
2005
IEEE
Sequential elements, flip-flops, latches, and memory cells, are the most vulnerable components to soft errors. Since state-of-the-art designs contain millions of bistables, it i...