458 search results - page 14 / 92 » Distance graphs: from random geometric graphs to Bernoulli g... |
WADS
2007
Springer
14 years 2 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
PR
2007
13 years 8 months ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
ICASSP
2010
IEEE
13 years 9 months ago
2010
IEEE
We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors gra...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— In this contribution the radio channel model proposed in [1] is extended to include multiple transmitters and receivers. The propagation environment is modelled using r...
SIAMCOMP
2010
13 years 7 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...