2304 search results - page 30 / 461 » On the Vulnerability of Large Graphs |
GD
2006
Springer
14 years 1 months ago
2006
Springer
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....
KDD
2006
ACM
14 years 10 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
ICDE
2008
IEEE
14 years 11 months ago
2008
IEEE
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
COLT
2004
Springer
14 years 3 months ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
GD
2004
Springer
14 years 3 months ago
2004
Springer
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...