Abstract. Searching in metric spaces is a very active field since it offers methods for indexing and searching by similarity in collections of unstructured data. These methods sele...
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
In this paper we study a parallel algorithm for computing the singular value decomposition (SVD) of a product of two matrices on message passing multiprocessors. This algorithm is ...
The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space...