2489 search results - page 170 / 498 » On the Subgroup Distance Problem |
145
Voted
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
For various 3D shape analysis tasks, the LaplaceBeltrami(LB) embedding has become increasingly popular as it enables the efficient comparison of shapes based on intrinsic geometry...
150
click to vote
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
15 years 4 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...
136
click to vote
DCG
2008
15 years 4 months ago
2008
In [GL] it was shown that a polytope with few vertices is far from being symmetric in the Banach-Mazur distance. More precisely, it was shown that Banach-Mazur distance between su...
152
click to vote
AMC
2005
15 years 4 months ago
2005
In this paper a new and efficient supervised method for color image segmentation is presented. This method improves a part of the automatic extraction problem. The basic technique...
127
click to vote
EMNLP
2010
15 years 2 months ago
2010
While a significant amount of research has been devoted to textual entailment, automated entailment from conversational scripts has received less attention. To address this limita...