541 search results - page 47 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
EDBT
2004
ACM
14 years 8 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
KDD
1997
ACM
14 years 27 days ago
1997
ACM
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
PAKDD
2001
ACM
14 years 1 months ago
2001
ACM
Data clustering methods have many applications in the area of data mining. Traditional clustering algorithms deal with quantitative or categorical data points. However, there exist...
GIS
2009
ACM
14 years 9 months ago
2009
ACM
We envision participatory texture documentation (PTD) as a process in which a group of users (dedicated individuals and/or general public) with camera-equipped mobile phones parti...
SDM
2010
SIAM
13 years 7 months ago
2010
SIAM
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...