ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Efficient Time Series Matching by Wavelets.

Kin-pong Chan, Ada Wai-Chee Fu: Efficient Time Series Matching by Wavelets. ICDE 1999: 126-133
@inproceedings{DBLP:conf/icde/ChanF99,
  author    = {Kin-pong Chan and
               Ada Wai-Chee Fu},
  title     = {Efficient Time Series Matching by Wavelets},
  booktitle = {Proceedings of the 15th International Conference on Data Engineering,
               23-26 March 1999, Sydney, Austrialia},
  publisher = {IEEE Computer Society},
  year      = {1999},
  pages     = {126-133},
  ee        = {db/conf/icde/ChanF99.html},
  crossref  = {DBLP:conf/icde/99},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1999 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.


ACM SIGMOD DiSC

CDROM Version: Load the CDROM "DiSC, Volume 2 Number 1" and ...

ACM SIGMOD Anthology

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Online Edition: IEEE Computer Society DL

Citation Page

Printed Edition

Proceedings of the 15th International Conference on Data Engineering, 23-26 March 1999, Sydney, Austrialia. IEEE Computer Society 1999
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

References

[1]
...
[2]
Rakesh Agrawal, Christos Faloutsos, Arun N. Swami: Efficient Similarity Search In Sequence Databases. FODO 1993: 69-84 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[3]
Rakesh Agrawal, Ramakrishnan Srikant: Mining Sequential Patterns. ICDE 1995: 3-14 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[4]
...
[5]
Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD Conference 1990: 322-331 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[6]
...
[7]
Stefan Berchtold, Daniel A. Keim, Hans-Peter Kriegel: The X-tree : An Index Structure for High-Dimensional Data. VLDB 1996: 28-39 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[8]
...
[9]
...
[10]
...
[11]
King Lum Cheung, Ada Wai-Chee Fu: Enhanced Nearest Neighbour Search on the R-tree. SIGMOD Record 27(3): 16-21(1998) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[12]
Kelvin Kam Wing Chu, Sze Kin Lam, Man Hon Wong: An Efficient Hash-Based Algorithm for Sequence Data Searching. Comput. J. 41(6): 402-415(1998) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[13]
Tzi-cker Chiueh: Content-Based Image Indexing. VLDB 1994: 582-593 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[14]
...
[15]
Christos Faloutsos, M. Ranganathan, Yannis Manolopoulos: Fast Subsequence Matching in Time-Series Databases. SIGMOD Conference 1994: 419-429 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[16]
...
[17]
...
[18]
...
[19]
...
[20]
Antonin Guttman: R-Trees: A Dynamic Index Structure for Spatial Searching. SIGMOD Conference 1984: 47-57 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[21]
...
[22]
Flip Korn, H. V. Jagadish, Christos Faloutsos: Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences. SIGMOD Conference 1997: 289-300 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[23]
...
[24]
Davood Rafiei, Alberto O. Mendelzon: Similarity-Based Queries for Time Series Data. SIGMOD Conference 1997: 13-25 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[25]
Nick Roussopoulos, Stephen Kelley, Frédéic Vincent: Nearest Neighbor Queries. SIGMOD Conference 1995: 71-79 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[26]
...
[27]
...
[28]
Daniel Wu, Divyakant Agrawal, Amr El Abbadi, Ambuj K. Singh, Terence R. Smith: Efficient Retrieval for Browsing Large Image Databases. CIKM 1996: 11-18 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Copyright © Sun Nov 15 04:37:48 2009 by Michael Ley (ley@uni-trier.de)