Pages that link to "Item:Q1869745"
From MaRDI portal
The following pages link to Approximate congruence in nearly linear time (Q1869745):
Displaying 12 items.
- Approximate one-to-one point pattern matching (Q450574) (← links)
- Noisy colored point set matching (Q628337) (← links)
- Approximate decision algorithms for point set congruence (Q1328753) (← links)
- Congruence, similarity, and symmetries of geometric objects (Q1822962) (← links)
- Bipartite diameter and other measures under translation (Q2172648) (← links)
- Linear Approximations of Addition Modulo 2n-1 (Q3013094) (← links)
- Finding Largest Common Point Sets (Q3132918) (← links)
- Geometric matching under noise: Combinatorial bounds and algorithms (Q4252321) (← links)
- (Q5090454) (← links)
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES (Q5484909) (← links)
- Fast Software Encryption (Q5713927) (← links)
- Geometry helps in bottleneck matching and related problems (Q5946120) (← links)