1664 search results - page 121 / 333 » Distance labeling in graphs |
134
click to vote
ISPAN
2002
IEEE
15 years 9 months ago
2002
IEEE
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes...
113
click to vote
ARSCOM
2008
15 years 4 months ago
2008
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
156
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
The standard graph cut technique is a robust method for globally optimal image segmentations. However, because of its global nature, it is prone to capture outlying areas similar ...
121
click to vote
COMBINATORICA
2007
15 years 4 months ago
2007
What is the maximum possible number, f3(n), of vectors of length n over {0, 1, 2} such that the Hamming distance between every two is even? What is the maximum possible number, g3...
143
click to vote
CVPR
2011
IEEE
15 years 22 days ago
2011
IEEE
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...