Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Maximum_subarray_problem> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- Maximum_subarray_problem abstract "In computer science, the maximum subarray problem is the task of finding the contiguous subarray within a one-dimensional array of numbers (containing at least one positive number) which has the largest sum. For example, for the sequence of values −2, 1, −3, 4, −1, 2, 1, −5, 4; the contiguous subarray with the largest sum is 4, −1, 2, 1, with sum 6.The problem was first posed by Ulf Grenander of Brown University in 1977, as a simplified model for maximum likelihood estimation of patterns in digitized images. A linear time algorithm was found soon afterwards by Jay Kadane of Carnegie-Mellon University (Bentley 1984).".
- Maximum_subarray_problem wikiPageExternalLink kadane.
- Maximum_subarray_problem wikiPageExternalLink Kadane's_Algorithm.
- Maximum_subarray_problem wikiPageExternalLink cats02.pdf.
- Maximum_subarray_problem wikiPageExternalLink AlgorithmDesignTechniques.pdf.
- Maximum_subarray_problem wikiPageID "10575678".
- Maximum_subarray_problem wikiPageRevisionID "603820302".
- Maximum_subarray_problem hasPhotoCollection Maximum_subarray_problem.
- Maximum_subarray_problem subject Category:Articles_with_example_Python_code.
- Maximum_subarray_problem subject Category:Dynamic_programming.
- Maximum_subarray_problem subject Category:Optimization_algorithms_and_methods.
- Maximum_subarray_problem type Abstraction100002137.
- Maximum_subarray_problem type Act100030358.
- Maximum_subarray_problem type Activity100407535.
- Maximum_subarray_problem type Algorithm105847438.
- Maximum_subarray_problem type Event100029378.
- Maximum_subarray_problem type OptimizationAlgorithmsAndMethods.
- Maximum_subarray_problem type Procedure101023820.
- Maximum_subarray_problem type PsychologicalFeature100023100.
- Maximum_subarray_problem type Rule105846932.
- Maximum_subarray_problem type YagoPermanentlyLocatedEntity.
- Maximum_subarray_problem comment "In computer science, the maximum subarray problem is the task of finding the contiguous subarray within a one-dimensional array of numbers (containing at least one positive number) which has the largest sum.".
- Maximum_subarray_problem label "Maximum subarray problem".
- Maximum_subarray_problem label "Sublista contígua de soma máxima".
- Maximum_subarray_problem sameAs Πρόβλημα_μέγιστου_αθροίσματος_υποακολουθίας.
- Maximum_subarray_problem sameAs Sublista_contígua_de_soma_máxima.
- Maximum_subarray_problem sameAs m.02qj76m.
- Maximum_subarray_problem sameAs Q1334332.
- Maximum_subarray_problem sameAs Q1334332.
- Maximum_subarray_problem sameAs Maximum_subarray_problem.
- Maximum_subarray_problem wasDerivedFrom Maximum_subarray_problem?oldid=603820302.
- Maximum_subarray_problem isPrimaryTopicOf Maximum_subarray_problem.