38 search results - page 6 / 8 » Rescheduling for Locality in Sparse Matrix Computations |
ISPASS
2009
IEEE
15 years 4 months ago
2009
IEEE
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— The main contribution of this paper is a new SLAM algorithm for the mapping of large scale environments by combining local maps. The local maps can be generated by traditional ...
105
click to vote
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
In image retrieval, most existing approaches that incorporate local features produce high dimensional vectors, which lead to a high computational and data storage cost. Moreover, ...
129
Voted
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
121
click to vote
CP
2003
Springer
15 years 2 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...