-
1
-
-
0002644607
-
Fast similarity search in the presence of noise, scaling, and translation in time-series databases
-
Zurich, Switzerland, September
-
R. Agrawal, K. Sawhney, K. Shim, "Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases, " in Proc. of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Zurich, Switzerland, September 1995, pp. 490-501.
-
(1995)
Proc. of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
, pp. 490-501
-
-
Agrawal, R.1
Sawhney, K.2
Shim, K.3
-
2
-
-
0013236534
-
String editing and longest common subsequence
-
G. Rozenberg and A. Salomaa, editors,Berlin,Springer Verlag
-
A. Apostolico, "String editing and longest common subsequence, " G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, vol. 2, pp. 36 1-398, Berlin, 1997. Springer Verlag.
-
(1997)
Handbook of Formal Languages
, vol.2
, pp. 361-398
-
-
Apostolico, A.1
-
3
-
-
52649179212
-
Probabilistic discovery of time series motifs
-
Washington, DC, USA, August
-
B. Chiu, E. Keogh, and S. Lonardi, "Probabilistic Discovery of Time Series Motifs, " in Proc. of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 2003, pp. 493-498.
-
(2003)
Proc. of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
, pp. 493-498
-
-
Chiu, B.1
Keogh, E.2
Lonardi, S.3
-
4
-
-
0003114361
-
Finding similar time series
-
G. Das, D. Gunopulos, and H. Mannila, "Finding similar time series, " Principles of Data Mining and Knowledge Discovery, vol. 19, pp. 88-100, 1997.
-
(1997)
Principles of Data Mining and Knowledge Discovery
, vol.19
, pp. 88-100
-
-
Das, G.1
Gunopulos, D.2
Mannila, H.3
-
5
-
-
84976825385
-
Algorithms for the longest common subsequence problem
-
D. S. Hirschberg, "Algorithms for the longest common subsequence problem, " JACM, vol. 24 (4), pp. 664-675, 1977.
-
(1977)
JACM
, vol.24
, Issue.4
, pp. 664-675
-
-
Hirschberg, D.S.1
-
6
-
-
0017492836
-
A fast algorithm for computing longest common subsequences
-
J. W. Hunt & T. G. Szymanski, "A fast algorithm for computing longest common subsequences, " CACM, vol. 20 (5), pp. 350-353, 1977.
-
(1977)
CACM
, vol.20
, Issue.5
, pp. 350-353
-
-
Hunt, J.W.1
Szymanski, T.G.2
-
7
-
-
0034592912
-
Scaling up dynamic time warping for datamining applications
-
Boston, MA
-
E. Keogh, M. Pazzani, "Scaling up Dynamic Time Warping for Datamining Applications, " in Proc. of the 21st Int. Canf. on Very Large Databases, Boston, MA, 2000, pp. 285-289.
-
(2000)
Proc. of the 21st Int. Canf. on Very Large Databases
, pp. 285-289
-
-
Keogh, E.1
Pazzani, M.2
-
9
-
-
0036211177
-
Discovering similar multidimensional trajectories
-
San Jose, CA
-
M. Vlachos, G. Kollios, ans G. Gunopulos, "Discovering Similar Multidimensional Trajectories, " in Proc. of the 18th 1CDE, San Jose, CA, 2002, pp. 673-684.
-
(2002)
Proc. of the 18th 1CDE
, pp. 673-684
-
-
Vlachos, M.1
Kollios, G.2
Gunopulos, A.G.3
|