Pages that link to "Item:Q2380044"
From MaRDI portal
The following pages link to On the parameterized complexity of \(d\)-dimensional point set pattern matching (Q2380044):
Displaying 4 items.
- Approximate one-to-one point pattern matching (Q450574) (← links)
- A (slightly) faster algorithm for Klee's measure problem (Q1037647) (← links)
- FPTAS for minimizing the earth mover's distance under rigid transformations and related problems (Q2408088) (← links)
- APPROXIMATE NEAREST NEIGHBOR SEARCH UNDER TRANSLATION INVARIANT HAUSDORFF DISTANCE (Q3089097) (← links)
