38 search results - page 4 / 8 » Rescheduling for Locality in Sparse Matrix Computations |
ACPC
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...
ISRR
2005
Springer
13 years 11 months ago
2005
Springer
An open problem in Simultaneous Localization and Mapping (SLAM) is the development of algorithms which scale with the size of the environment. A few promising methods exploit the ...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
COMSIS
2010
13 years 2 months ago
2010
We propose a new method for matching two 3D point sets of identical cardinality with global similarity but local non-rigid deformations and distribution errors. This problem arises...
IJHPCA
2010
13 years 3 months ago
2010
Sparse matrix operations achieve only small fractions of peak CPU speeds because of the use of specialized, indexbased matrix representations, which degrade cache utilization by i...