2304 search results - page 190 / 461 » On the Vulnerability of Large Graphs |
355
click to vote
SDM
2011
SIAM
14 years 9 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
147
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
196
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
148
click to vote
FASE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. E-government services usually process large amounts of confidential data. Therefore, security requirements for the communication between components have to be adhered in...
157
click to vote
SIGCOMM
2009
ACM
16 years 1 months ago
2009
ACM
Most of the existing literature on empirical studies of Online Social Networks (OSNs) have focused on characterizing and modeling the structure of their inferred friendship graphs...