Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...
Maria Kontaki, Apostolos Papadopoulos, Yannis Mano...
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...
Gang Qian, Hyun-Jeong Seok, Qiang Zhu, Sakti Prama...
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...