The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
A common problem in moving object databases (MOD) is the reconstruction of a trajectory from a trajectory sample (i.e., a finite sequence of time-space points). A typical solution...
Alejandro A. Vaisman, Bart Kuijpers, Bart Moelans,...
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Information retrieval or search plays an important role in a wide range of information management and electronic commerce tasks. In spite of the importance of information retrieva...
Nicholas J. Belkin, Susan T. Dumais, Jean Scholtz,...
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...