2304 search results - page 34 / 461 » On the Vulnerability of Large Graphs |
SDM
2007
SIAM
13 years 11 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
DASFAA
2010
IEEE
13 years 11 months ago
2010
IEEE
An overlay network called Range-key Skip Graph (RKSG) has been proposed that can perform range-to-range search on peer-topeer network. In this paper, we propose a large scale key-v...
ICDE
2005
IEEE
14 years 11 months ago
2005
IEEE
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
CIKM
2009
Springer
14 years 1 months ago
2009
Springer
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...