FINDING MANY OPTIMAL PATHS WITHOUT GROWING ANY OPTIMAL PATH TREES (Q4931732): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Finding an optimal path without growing the tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: IMAGE SEGMENTATION WITH ASTEROIDALITY/TUBULARITY AND SMOOTHNESS CONSTRAINTS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2747613 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal surface reconstruction from planar contours / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear space algorithm for computing maximal common subsequences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding rotational symmetries by cyclic string matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a cyclic string-to-string correction problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The String-to-String Correction Problem / rank | |||
Normal rank | |||
Latest revision as of 07:22, 3 July 2024
scientific article; zbMATH DE number 5793867
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | FINDING MANY OPTIMAL PATHS WITHOUT GROWING ANY OPTIMAL PATH TREES |
scientific article; zbMATH DE number 5793867 |
Statements
FINDING MANY OPTIMAL PATHS WITHOUT GROWING ANY OPTIMAL PATH TREES (English)
0 references
30 September 2010
0 references
shortest path
0 references
space complexity
0 references
pattern recognition
0 references
surface reconstruction
0 references
image segmentation
0 references
circular string-to-string correction
0 references
