575 search results - page 7 / 115 » Computing Maximum Subsequence in Parallel |
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
We present practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences. We consider both constant and af...
PAMI
2008
13 years 7 months ago
2008
Morphological attribute filters have not previously been parallelized mainly because they are both global and nonseparable. We propose a parallel algorithm that achieves efficient ...
PPOPP
1993
ACM
13 years 11 months ago
1993
ACM
We describe computation migration,a new technique that is based on compile-time program transformations, for accessing remote data in a distributed-memory parallel system. In cont...
ICS
2010
Tsinghua U.
13 years 11 months ago
2010
Tsinghua U.
: Maximizing revenue in the presence of perfectly informed players is a well known goal in mechanism design. Yet, all current mechanisms for this goal are vulnerable to equilibrium...
STRINGOLOGY
2004
13 years 8 months ago
2004
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...