575 search results - page 22 / 115 » Computing Maximum Subsequence in Parallel |
PPOPP
2005
ACM
14 years 1 months ago
2005
ACM
In concurrent programming, non-blocking synchronization is very efficient but difficult to design correctly. This paper presents a static analysis to show that code blocks are ato...
SKG
2006
IEEE
14 years 1 months ago
2006
IEEE
Convolution kernels, such as tree kernel and subsequence kernel are useful for natural language processing tasks. However, most of them ignore the semantic knowledge. In order to ...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
CLUSTER
2006
IEEE
13 years 11 months ago
2006
IEEE
Effective overlap of computation and communication is a well understood technique for latency hiding and can yield significant performance gains for applications on high-end compu...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
High-performance computing is and has always been performance oriented. However, a consequence of the push towards maximum performance is increased energy consumption, especially ...