557 search results - page 34 / 112 » Visualizing Weighted Edges in Graphs |
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...
101
click to vote
COCOON
2008
Springer
15 years 26 days ago
2008
Springer
In this paper, we consider a new visual cryptography scheme that allows for sharing of multiple secret images on graphs: we are given an arbitrary graph (V, E) where every node an...
BIRTHDAY
2009
Springer
15 years 5 months ago
2009
Springer
We introduce the weak gap property for directed graphs whose vertex set S is a metric space of size n. We prove that, if the doubling dimension of S is a constant, any directed gra...
SRDS
1998
IEEE
15 years 3 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
IPPS
1998
IEEE
15 years 3 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....