Efficient many-to-Many point matching in one dimension (Q2373930)
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 5172589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient many-to-Many point matching in one dimension |
scientific article; zbMATH DE number 5172589 |
Statements
Efficient many-to-Many point matching in one dimension (English)
0 references
19 July 2007
0 references
minimum-cost
0 references
matching problem
0 references
complexity
0 references
0 references
0.8417449593544006
0 references
0.7951251268386841
0 references
0.7494115829467773
0 references
0.7256209850311279
0 references
0.7149367332458496
0 references
