2304 search results - page 239 / 461 » On the Vulnerability of Large Graphs |
178
click to vote
ICNP
2009
IEEE
16 years 1 months ago
2009
IEEE
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...
166
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
207
click to vote
CGF
2010
15 years 6 months ago
2010
Social networks collected by historians or sociologists typically have a large number of actors and edge attributes. Applying social network analysis (SNA) algorithms to these net...
188
click to vote
IM
2007
15 years 6 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
346
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...