Finding many optimal paths without growing any optimal path trees (Q4931732)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5793867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9841094613075256
0 references
0.7927448749542236
0 references
0.7169650793075562
0 references
