2304 search results - page 149 / 461 » On the Vulnerability of Large Graphs |
163
click to vote
DSN
2009
IEEE
16 years 1 months ago
2009
IEEE
Topological worms, such as those that propagate by following links in an overlay network, have the potential to spread faster than traditional random scanning worms because they h...
185
click to vote
PPOPP
2006
ACM
16 years 6 days ago
2006
ACM
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
295
Voted
ICDE
2003
IEEE
16 years 7 months ago
2003
IEEE
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
177
click to vote
MODELS
2009
Springer
16 years 24 days ago
2009
Springer
Model-based development of highly complex software systems leads to large models. Storing them in repositories offers the possibility to work with these models in a distributed env...
179
click to vote
GD
1995
Springer
15 years 9 months ago
1995
Springer
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...