Pages that link to "Item:Q2373930"
From MaRDI portal
The following pages link to Efficient many-to-Many point matching in one dimension (Q2373930):
Displaying 4 items.
- An \(O(n^2)\) algorithm for the limited-capacity many-to-many point matching in one dimension (Q329283) (← links)
- Minimum many-to-many matchings for computing the distance between two sequences (Q497361) (← links)
- Computational geometric aspects of rhythm, melody, and voice-leading (Q733549) (← links)
- Faster retrieval with a two-pass dynamic-time-warping lower bound (Q2270858) (← links)
