575 search results - page 20 / 115 » Computing Maximum Subsequence in Parallel |
AIRS
2004
Springer
15 years 3 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
102
click to vote
EMMCVPR
2003
Springer
15 years 2 months ago
2003
Springer
The asymptotic distribution of estimates that are based on a sub-optimal search for the maximum of the log-likelihood function is considered. In particular, estimation schemes that...
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...
68
Voted
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper presents a new static and dynamic recursive parallel algorithm for the convex hull problem. This algorithm is a parallel adaptation of the Graham Scan and Quick Hull al...
CLUSTER
2000
IEEE
15 years 1 months ago
2000
IEEE
This paper presents a new approach towards parallel I/O for message-passing (MPI) applications on clusters built with commodity hardware and an SCI interconnect: instead of using t...