575 search results - page 1 / 115 » Computing Maximum Subsequence in Parallel |
WOB
2003
13 years 6 months ago
2003
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
CPM
2006
Springer
13 years 8 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
WWW
2009
ACM
14 years 5 months ago
2009
ACM
Much of the information on the Web is found in articles from online news outlets, magazines, encyclopedias, review collections, and other sources. However, extracting this content...
EUROPAR
2006
Springer
13 years 8 months ago
2006
Springer
CCCG
2009
13 years 5 months ago
2009
In this paper, we present new algorithms for computing maximum perimeter and maximum area of the convex hull of imprecise inputs based on the parallel line segment model. The runn...