46 search results - page 2 / 10 » Efficient Parallel Mappings of a Dynamic Programming Algorit... |
142
click to vote
IJCV
2002
15 years 2 months ago
2002
In this paper, a new hierarchical stereo algorithm is presented. The algorithm matches individual pixels in corresponding scanlines by minimizing a cost function. Several cost fun...
125
click to vote
SPAA
1995
ACM
15 years 6 months ago
1995
ACM
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
135
click to vote
CF
2006
ACM
15 years 7 months ago
2006
ACM
This paper presents our experience mapping OpenMP parallel programming model to the IBM Cyclops-64 (C64) architecture. The C64 employs a many-core-on-a-chip design that integrates...
116
click to vote
ICPP
2005
IEEE
15 years 8 months ago
2005
IEEE
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
132
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Millions of DNA sequences (reads) are generated by Next Generation Sequencing machines everyday. There is a need for high performance algorithms to map these sequences to the refer...