Pages that link to "Item:Q1101223"
From MaRDI portal
The following pages link to Geometric applications of a matrix-searching algorithm (Q1101223):
Displayed 28 items.
- An improved algorithm for tree edit distance with applications for RNA secondary structure comparison (Q2015811) (← links)
- \(L_{1}\) shortest path queries in simple polygons (Q2272388) (← links)
- Properties of the \(d\)-dimensional Earth mover's problem (Q2312655) (← links)
- The complexity of optimization on grids (Q2319631) (← links)
- Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time (Q2349742) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- Resequencing a set of strings based on a target string (Q2354022) (← links)
- Finding least-weight subsequences with fewer processors (Q2366242) (← links)
- Approximating points by a piecewise linear function (Q2375945) (← links)
- Efficient algorithms for finding interleaving relationship between sequences (Q2380070) (← links)
- Dynamic lot-sizing model for major and minor demands (Q2384637) (← links)
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
- Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks (Q2407947) (← links)
- Monge properties, discrete convexity and applications (Q2432877) (← links)
- 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)