2304 search results - page 278 / 461 » On the Vulnerability of Large Graphs |
170
click to vote
GC
2008
Springer
15 years 6 months ago
2008
Springer
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
196
click to vote
TON
2008
15 years 6 months ago
2008
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
164
click to vote
PKDD
2010
Springer
15 years 5 months ago
2010
Springer
Pattern mining methods for graph data have largely been restricted to ground features, such as frequent or correlated subgraphs. Kazius et al. have demonstrated the use of elaborat...
209
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
217
click to vote
ACCV
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We propose a methodology for recognizing actions at a distance by watching the human poses and deriving descriptors that capture the motion patterns of the poses. Human p...