1802 search results - page 8 / 361 » Sparse Computations with PEI |
ICCV
2005
IEEE
2005
IEEE
Is Levenberg-Marquardt the Most Efficient Optimization Algorithm for Implementing Bundle Adjustment?
14 years 8 months ago
In order to obtain optimal 3D structure and viewing parameter estimates, bundle adjustment is often used as the last step of feature-based structure and motion estimation algorith...
ASAP
2006
IEEE
13 years 10 months ago
2006
IEEE
In this paper, we propose a reconfigurable hardware accelerator for fixed-point-matrix-vector-multiply/add operations, capable to work on dense and sparse matrices formats. The pr...
PPAM
2001
Springer
13 years 11 months ago
2001
Springer
This paper presents an overview of pARMS, a package for solving sparse linear systems on parallel platforms. Preconditioners constitute the most important ingredient in the solutio...
IAJIT
2011
13 years 1 months ago
2011
: The present paper discusses the implementations of sparse matrix-vector products, which are crucial for high performance solutions of large-scale linear equations, on a PC-Cluste...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
Several methods have been proposed in the literature for the distribution of data on distributed memory machines, either oriented to dense or sparse structures. Many of the real a...