2004 search results - page 24 / 401 » Sampling from large graphs |
102
click to vote
SIAMSC
2008
14 years 11 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...
UAI
2000
15 years 1 months ago
2000
Sampling is an important tool for estimating large, complex sums and integrals over highdimensional spaces. For instance, importance sampling has been used as an alternative to ex...
112
click to vote
ICCTA
2007
IEEE
15 years 3 months ago
2007
IEEE
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper shows how to construct pattern vectors from the Ihara zeta function for the purposes of characterizing graph structures. To avoid the risk of sampling the meaningless i...
RSA
2002
14 years 11 months ago
2002
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. It is known that in this ca...