2304 search results - page 143 / 461 » On the Vulnerability of Large Graphs |
168
Voted
ESA
2000
Springer
15 years 9 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
165
click to vote
APVIS
2007
15 years 7 months ago
2007
In this paper, we introduce a new method, GraphScape, to visualize multivariate networks, i.e., graphs with multivariate data associated with their nodes. GraphScape adopts a land...
222
click to vote
GG
2010
Springer
15 years 7 months ago
2010
Springer
Model-driven development (MDD) has become a promising trend in software engineering. The model-driven development of highly complex software systems may lead to large models which ...
196
click to vote
PAMI
2007
15 years 5 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
187
click to vote
NDSS
2006
IEEE
16 years 7 days ago
2006
IEEE
The custom, ad hoc nature of web applications makes learning-based anomaly detection systems a suitable approach to provide early warning about the exploitation of novel vulnerabi...