Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
Abstract. The today's applications usually form a system of sub-applications, each being responsible for a particular functionality. Hence, the design and maintenance of such ...
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Multidimensional models are at the core of data warehouse systems, since they allow decision makers to early define the relevant information and queries that are required to satis...