941 search results - page 15 / 189 » Efficient Testing of Large Graphs |
WADT
1998
Springer
15 years 1 months ago
1998
Springer
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in gene...
105
click to vote
KDD
2008
ACM
15 years 10 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 ...
KDD
2006
ACM
15 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.)...
SIAMSC
2008
14 years 9 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
68
Voted
WWW
2009
ACM
15 years 10 months ago
2009
ACM
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...