6 search results - page 1 / 2 » Efficient Algorithms for the Maximum Subarray Problem by Dis... |
ENTCS
2002
13 years 4 months ago
2002
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
ISAAC
2007
Springer
13 years 10 months ago
2007
Springer
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
ALGORITHMICA
2011
12 years 11 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
ICIP
2006
IEEE
14 years 6 months ago
2006
IEEE
A novel procedure for in-silico (virtual) craniofacial reconstruction of human mandibles with multiple fractures from a sequence of Computed Tomography (CT) images is presented. T...
BMCBI
2010
13 years 4 months ago
2010
Background: There is an increasing demand to assemble and align large-scale biological sequence data sets. The commonly used multiple sequence alignment programs are still limited...