1883 search results - page 167 / 377 » Ordered theta graphs |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
MICRO
2009
IEEE
14 years 2 months ago
2009
IEEE
Incorrect thread synchronization often leads to concurrency bugs that manifest nondeterministically and are difficult to detect and fix. Past work on detecting concurrency bugs ...
SIGMOD
2010
ACM
13 years 8 months ago
2010
ACM
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
ICDM
2010
IEEE
13 years 6 months ago
2010
IEEE
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...