2304 search results - page 311 / 461 » On the Vulnerability of Large Graphs |
128
Voted
IPPS
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
101
Voted
INFOCOM
2011
IEEE
14 years 4 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
125
Voted
IACR
2011
14 years 14 days ago
2011
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
88
Voted
ICCV
2009
IEEE
16 years 5 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
138
Voted
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...