We consider the problem of elastic matching of time series. We propose an algorithm that determines a subsequence of a target time series that best matches a query series. In the ...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
The automatic detection of novelty, or newness, as part of an information retrieval system would greatly improve a searcher’s experience by presenting “documents” in order of...
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
Abstract. In emerging database applications that deal with large sets of multidimensional data, the performance of the query system significantly depends on the performance of its ...
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...