2304 search results - page 249 / 461 » On the Vulnerability of Large Graphs |
154
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
We present a new image segmentation algorithm based on graph cuts. Our main tool is separation of each pixel from a special point outside the image by a cut of a minimum cost. Suc...
204
click to vote
IWPC
2006
IEEE
16 years 20 days ago
2006
IEEE
Large software systems have a rich development history. Mining certain aspects of this rich history can reveal interesting insights into the system and its structure. Previous app...
179
click to vote
IPPS
2005
IEEE
16 years 7 days ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
195
Voted
LPAR
2005
Springer
16 years 4 days ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
176
click to vote
ICPP
1991
IEEE
15 years 10 months ago
1991
IEEE
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...