2004 search results - page 21 / 401 » Sampling from large graphs |
105
click to vote
SIAMCOMP
2011
14 years 6 months ago
2011
Reingold, Vadhan and Wigderson [21] introduced the graph zig-zag product. This product combines a large graph and a small graph into one graph, such that the resulting graph inher...
KDD
2004
ACM
16 years 3 days ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
IMR
2004
Springer
15 years 5 months ago
2004
Springer
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
154
click to vote
COMPGEOM
2011
ACM
14 years 3 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
110
Voted
NAACL
2010
14 years 9 months ago
2010
We present a random-walk-based approach to learning paraphrases from bilingual parallel corpora. The corpora are represented as a graph in which a node corresponds to a phrase, an...