515 search results - page 55 / 103 » Subsequence Matching on Structured Time Series Data |
AMAI
1999
Springer
14 years 9 months ago
1999
Springer
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
We present a new visualization of the distance and cluster structure of high dimensional data. It is particularly well suited for analysis tasks of users unfamiliar with complex d...
SODA
1998
ACM
14 years 11 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
AMW
2009
14 years 11 months ago
2009
Conventional operators for data retrieval are either based on exact matching or on total order relationship among elements. Neither of them is appropriate to manage complex data, s...
FQAS
2009
Springer
15 years 4 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...