2304 search results - page 64 / 461 » On the Vulnerability of Large Graphs |
108
click to vote
TAMC
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
SSPR
1998
Springer
15 years 4 months ago
1998
Springer
This paper presents a probabilistic similarity measure for object recognition from large libraries of line-patterns. We commence from a structural pattern representation which use...
113
click to vote
JMLR
2012
13 years 2 months ago
2012
We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the sample covariance graph formed by thresholding th...
WDAG
2009
Springer
15 years 6 months ago
2009
Springer
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
WEBI
2009
Springer
15 years 6 months ago
2009
Springer
—In this paper, we investigate the problem of supporting keyword-based searching for the discovery of software resources that are installed on the nodes of largescale, federated ...