Pages that link to "Item:Q1101223"
From MaRDI portal
The following pages link to Geometric applications of a matrix-searching algorithm (Q1101223):
Displayed 14 items.
- A generalization of magic squares with applications to digital halftoning (Q2480747) (← links)
- Hausdorff approximation of convex polygons (Q2573338) (← links)
- Optimum extensions of prefix codes. (Q2583535) (← links)
- Deterministic Algorithms for Unique Sink Orientations of Grids (Q2817878) (← links)
- Speeding up Dynamic Programming in the Line-Constrained k-median (Q2819512) (← links)
- Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance (Q3183457) (← links)
- Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (Q3448817) (← links)
- Sequence Alignment Algorithms for Run-Length-Encoded Strings (Q3511343) (← links)
- GEOMETRIC ALGORITHMS FOR THE CONSTRAINED 1-D K-MEANS CLUSTERING PROBLEMS AND IMRT APPLICATIONS (Q3634189) (← links)
- Selection and sorting in totally monotone arrays (Q3979609) (← links)
- EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION (Q4682172) (← links)
- (Q5743404) (← links)
- Fast parallel algorithms for the maximum empty rectangle problem. (Q5955753) (← links)
- Scheduling with batching: Two job types (Q5961608) (← links)