Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1   Agrawal, R. et al., "Efficient Similarity Search in Sequence Databases," In Proc. Int'l Conf. on Foundations of Data Organization and Algorithms, pp. 69-84, Chicago, Illinois, Oct. 1993.

2   Agrawal, R. et al., "Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases," In Proc. Int'l Conf. on Very Large Data Bases, pp. 490-501, Zurich, Switzerland, Sept. 1995.

3   Agrawal, R. et al., "Querying Shapes of Histories," In Proc. Int'l Conf. on Very Large Data Bases, pp. 502-514, Zurich, Switzerland, Sept. 1995.

4   Norbert Beckmann , Hans-Peter Kriegel , Ralf Schneider , Bernhard Seeger, The R*-tree: an efficient and robust access method for points and rectangles, Proceedings of the 1990 ACM SIGMOD international conference on Management of data, p.322-331, May 23-26, 1990, Atlantic City, New Jersey, United States

5   Berchtold, S. et al., "The X-tree: An Index Structure for High-Dimensional Data," In Proc. Int'l Conf. on Very Large Data Bases, pp. 28-39, Mumbai, India, Sept. 1996.

6   Chatfield, C., The Analysis of Time Series: An Introduction, 3rd Ed., Chapman and Hall, 1984.

7   Chan, K.-P. and Fu, W.-C., "Efficient Time Series Matching by Wavelets," In Proc. Int'l Conf. on Data Engineering, IEEE, pp. 126-133, Sydney, Australia, Mar. 1999.

8   Kelvin Kam Wing Chu , Man Hon Wong, Fast time-series searching with scaling and shifting, Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.237-248, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States

9   Christos Faloutsos , M. Ranganathan , Yannis Manolopoulos, Fast subsequence matching in time-series databases, Proceedings of the 1994 ACM SIGMOD international conference on Management of data, p.419-429, May 24-27, 1994, Minneapolis, Minnesota, United States

10   Goldin, D. Q. and Kanellakis, P. C., "On Similarity Queries for Time-Series Data: Constraint Specification and Implementation," In Proc. Int'l Conf. on Principles and Practices of Constraint Programming, pp. 137-153, Cassis, France, Sept. 1995.

11   Rafael C. Gonzalez , Richard E. Woods, Digital Image Processing, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1992

12   Guttman, A., "R-trees: A Dynamic Index Structure for Spatial Searching," In Proc. Int'l Conf. on Management of Data, ACM SIGMOD, pp. 47-57, Boston, Massachusetts, June 1984.

13   Johnson M. Hart, Win32 Systems Programming, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997

14   William H. Press , Saul A. Teukolsky , William T. Vetterling , Brian P. Flannery, Numerical recipes in C (2nd ed.): the art of scientific computing, Cambridge University Press, New York, NY, 1992

15   Davood Rafiei , Alberto Mendelzon, Similarity-based queries for time series data, Proceedings of the 1997 ACM SIGMOD international conference on Management of data, p.13-25, May 11-15, 1997, Tucson, Arizona, United States

16   Sellis, T. et al., "The R + -tree: A Dynamic Index for Multidimensional Objects," In Proc. Int'l Conf. on Very Large Data Bases, pp. 507-518, Brighton, England, Sept. 1987.

17   Weber,R.et al.,"AQuantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces," In Proc. Int'l Conf. on Very Large Data Bases, pp. 194-205, New York, New York, Aug. 1998.

18   Yi, B.-K. et al., "Efficient Retrieval of Similar Time Sequences Under Time Warping," In Proc. Int'l Conf. on Data Engineering, IEEE, pp. 201-208, Orlando, Florida, Feb. 1998.

Sang-Wook Kim , Jeehee Yoon , Sanghyun Park , Tae-Hoon Kim, Shape-based retrieval of similar subsequences in time-series databases, Proceedings of the 17th symposium on Proceedings of the 2002 ACM symposium on applied computing, March 11-14, 2002, Madrid, Spain

Eamonn Keogh , Selina Chu , Michael Pazzani, Ensemble-index: a new approach to indexing large databases, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, p.117-125, August 26-29, 2001, San Francisco, California

Eamonn Keogh , Kaushik Chakrabarti , Michael Pazzani , Sharad Mehrotra, Locally adaptive dimensionality reduction for indexing large time series databases, ACM SIGMOD Record, v.30 n.2, p.151-162, June 2001

Kaushik Chakrabarti , Eamonn Keogh , Sharad Mehrotra , Michael Pazzani, Locally adaptive dimensionality reduction for indexing large time series databases, ACM Transactions on Database Systems (TODS), v.27 n.2, p.188-228, June 2002

Eamonn Keogh , Shruti Kasetty, On the need for time series data mining benchmarks: a survey and empirical demonstration, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, July 23-26, 2002, Edmonton, Alberta, Canada

• M⁴: a metamodel for data preprocessing
  Proceedings of the fourth ACM international workshop on Data warehousing and OLAP
  Anca Vaduva ,  Jörg-Uwe Kietz ,  Regina Zücker
  
  
• Evaluating topic-driven web crawlers
  Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
  Filippo Menczer ,  Gautam Pant ,  Padmini Srinivasan ,  Miguel E. Ruiz
  
  
• Partitioning-based standard-cell global placement with an exact objective
  Proceedings of the 1997 international symposium on Physical design
  Dennis J.-H. Huang ,  Andrew B. Kahng
  
  
• Information systems strategy and implementation: a case study of a building society
  ACM Transactions on Information Systems (TOIS)   12, 2
  G. Walsham ,  T. Waema