70 search results - page 11 / 14 » Distance Labeling in Hyperbolic Graphs |
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...
RECOMB
2008
Springer
14 years 10 months ago
2008
Springer
Following various genetic mapping techniques conducted on different segregating populations, one or more genetic maps are obtained for a given species. However, recombination analy...
MICCAI
2010
Springer
13 years 8 months ago
2010
Springer
We present a new non-parametric model constraint graph min-cut algorithm for automatic kidney segmentation in CT images. The segmentation is formulated as a maximum a-posteriori es...
PODS
2004
ACM
14 years 10 months ago
2004
ACM
We present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane such as many road networks. We h...
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
13 years 10 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...