1664 search results - page 105 / 333 » Distance labeling in graphs |
133
click to vote
EJC
2008
15 years 4 months ago
2008
We study restricted homomorphism dualities in the context of classes with bounded expansion. This presents a generalization of restricted dualities obtained earlier for bounded deg...
139
click to vote
ECCV
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. A novel method is proposed for performing multi-label, semi-automated image segmentation. Given a small number of pixels with user-defined labels, one can analytically (...
146
click to vote
IPMI
2007
Springer
16 years 5 months ago
2007
Springer
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
106
click to vote
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
We present an Outlier Detection using Indegree Number (ODIN) algorithm that utilizes k-nearest neighbour graph. Improvements to existing kNN distance -based method are also propos...
127
click to vote
DM
2008
15 years 4 months ago
2008
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G from u to v is at least the distance from u to any neighbour of v. We give the ...