In this article we investigate a novel execution paradigm—ML-like pattern-matching— for XML query processing. We show that such a paradigm is well adapted for a common and freq...
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
An important problem for many location-based applications is the continuous evaluation of proximity relations among moving objects. These relations express whether a given set of ...
In this paper, we present an index structure-based method to fast and robustly search short video clips in large video collections. First we temporally segment a given long video ...
With the popularization of GPS-enabled devices there is an increasing interest for location-based queries. In this context, one interesting problem is processing top-k spatial key...