1664 search results - page 142 / 333 » Distance labeling in graphs |
140
click to vote
COMBINATORICS
2004
15 years 4 months ago
2004
It is shown that if a d-regular graph contains s vertices so that the distance between any pair is at least 4k, then its adjacency matrix has at least s eigenvalues which are at l...
160
Voted
ICIAP
2009
ACM
15 years 2 months ago
2009
ACM
Abstract. Shape classification using graphs and skeletons usually involves edition processes in order to reduce the influence of structural noise. However, edition distances can no...
156
Voted
ISCSCT
2008
IEEE
15 years 11 months ago
2008
IEEE
—In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by m...
132
Voted
DM
2006
15 years 4 months ago
2006
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
224
click to vote
PAMI
2006
15 years 4 months ago
2006
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...