Faster retrieval with a two-pass dynamic-time-warping lower bound (Q2270858): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56228138, #quickstatements; #temporary_batch_1712272666262
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Dynamic programming algorithm optimization for spoken word recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line signature recognition based on VQ-DTW / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3047465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast \(k\)-nearest-neighbor search based on projection and triangular inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An energy-based similarity measure for time series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient many-to-Many point matching in one dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5757091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and exact warping of time series using adaptive segmental approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3342799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473286 / rank
 
Normal rank

Latest revision as of 20:56, 1 July 2024

scientific article
Language Label Description Also known as
English
Faster retrieval with a two-pass dynamic-time-warping lower bound
scientific article

    Statements

    Faster retrieval with a two-pass dynamic-time-warping lower bound (English)
    0 references
    0 references
    29 July 2009
    0 references
    time series
    0 references
    very large databases
    0 references
    indexing
    0 references
    classification
    0 references

    Identifiers