The following pages link to (Q2921659):
Displayed 14 items.
- The parameterized complexity of geometric graph isomorphism (Q309786) (← links)
- New complexity bounds for image matching under rotation and scaling (Q533416) (← links)
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789) (← links)
- The exact complexity of projective image matching (Q736619) (← links)
- A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation (Q1038471) (← links)
- The generic combinatorial algorithm for image matching with classes of projective transformations (Q2216108) (← links)
- Computational aspects of the Gromov-Hausdorff distance and its application in non-rigid shape matching (Q2358822) (← links)
- On the parameterized complexity of \(d\)-dimensional point set pattern matching (Q2380044) (← links)
- Inapproximability for metric embeddings into $\mathbb{R}^{d}$ (Q3065742) (← links)
- Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces (Q3119488) (← links)
- Two-Dimensional Pattern Matching with Combined Scaling and Rotation (Q3506938) (← links)
- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs (Q3512470) (← links)
- New Complexity Bounds for Image Matching under Rotation and Scaling (Q3637109) (← links)
- (Q5115789) (← links)