71 search results - page 4 / 15 » Optimal Distance Bounds on Time-Series Data. |
APVIS
2009
14 years 11 months ago
2009
To analyze time-varying data sets, tracking features over time is often necessary to better understand the dynamic nature of the underlying physical process. Tracking 3D time-vary...
172
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
Similarity-based search over time-series databases has been a hot research topic for a long history, which is widely used in many applications, including multimedia retrieval, dat...
167
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
VLDB
2004
ACM
15 years 3 months ago
2004
ACM
Existing studies on time series are based on two categories of distance functions. The first category consists of the Lp-norms. They are metric distance functions but cannot supp...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...