Sciweavers

2922 search results - page 274 / 585
» Scalable Algorithms for Distribution Search
Sort
View
176
Voted
ERSHOV
2009
Springer
15 years 8 months ago
Indexing Dense Nested Metric Spaces for Efficient Similarity Search
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...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
CORR
2006
Springer
160views Education» more  CORR 2006»
15 years 4 months ago
On Conditional Branches in Optimal Search Trees
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 ...
Michael B. Baer
EDBT
2009
ACM
175views Database» more  EDBT 2009»
15 years 11 months ago
Towards materialized view selection for distributed databases
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...
PVM
1999
Springer
15 years 8 months ago
Parallel Computation of the SVD of a Matrix Product
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 ...
José M. Claver, Manuel Mollar, Vicente Hern...
CORR
2010
Springer
92views Education» more  CORR 2010»
15 years 1 months ago
Regression on fixed-rank positive semidefinite matrices: a Riemannian approach
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...
Gilles Meyer, Silvere Bonnabel, Rodolphe Sepulchre