Y. Zhu and D. Shasha. Query by humming: a time series database approach. In Proc. ACM SIGMOD (Int'l Conf. on Management of Data), San Diego, CA, June 2003.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Indexing Multi-Dimensional Time-Series with.. - Vlachos.. (2003) (3 citations) (Correct)
....we evaluate the distance between the MBRs. The overall distance between the MBRs underestimates the true distance of the trajectories, and no false dismissals are introduced. Using the MBRs we can also calculate upper bound estimates on the distance, which hadn t been exploited in previous work [10, 22]. Sequences with lower bound larger than the smallest upper bound can be pruned. With this additional prefiltering step we can gain on average an additional 10 15 speedup in the total execution time. Due to space limitations only a visual representation of this approach is provided in figure 6. ....
Y. Zhu and D. Shasha. Query by humming: a time series database approach. In Proc. of SIGMOD, 2003.
Normalization of Life Science Data for Shape-based Similarity.. - Goldin (Correct)
No context found.
Y. Zhu and D. Shasha. Query by humming: a time series database approach. In Proc. ACM SIGMOD (Int'l Conf. on Management of Data), San Diego, CA, June 2003.
Normalization of Life Science Data for Shape-based Similarity.. - Goldin (Correct)
No context found.
Y. Zhu and D. Shasha. Query by humming: a time series database approach. In Proc. ACM SIGMOD (Int'l Conf. on Management of Data), San Diego, CA, June 2003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC