Pages that link to "Item:Q5946120"
From MaRDI portal
The following pages link to Geometry helps in bottleneck matching and related problems (Q5946120):
Displayed 12 items.
- Approximate one-to-one point pattern matching (Q450574) (← links)
- Parametric search made practical (Q598230) (← links)
- Noisy colored point set matching (Q628337) (← links)
- Natural pseudo-distance and optimal matching between reduced size functions (Q966491) (← links)
- Bottleneck flows in unit capacity networks (Q976109) (← links)
- Aggregation error for location models: Survey and analysis (Q1026594) (← links)
- Efficient many-to-Many point matching in one dimension (Q2373930) (← links)
- On the parameterized complexity of \(d\)-dimensional point set pattern matching (Q2380044) (← links)
- Hausdorff matching and Lipschitz optimization (Q2457916) (← links)
- TURNING SHAPE DECISION PROBLEMS INTO MEASURES (Q4669615) (← links)
- AN APPROXIMATE MORPHING BETWEEN POLYLINES (Q5311633) (← links)
- FAST CLUSTERING AND MINIMUM WEIGHT MATCHING ALGORITHMS FOR VERY LARGE MOBILE BACKBONE WIRELESS NETWORKS (Q5696904) (← links)