Matches in DBpedia 2014 for { <http://dbpedia.org/resource/SMAWK_algorithm> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- SMAWK_algorithm abstract "The SMAWK algorithm is an algorithm for finding the minimum value in each row of an implicitly-defined totally monotone matrix. It is named after the initials of its five inventors, Peter Shor, Shlomo Moran, Alok Aggarwal, Robert Wilber, and Maria Klawe.For the purposes of this algorithm, a matrix is defined to be monotone if each row's minimum value occurs in a column which is equal to or greater than the column of the previous row's minimum. It is totally monotone if the same property is true for every submatrix (defined by an arbitrary subset of the rows and columns of the given matrix). Equivalently, a matrix is totally monotone if there does not exist a 2×2 submatrix whose row minima are in the top left and bottom right corners. Every Monge array is totally monotone, but not necessarily vice versa.For the SMAWK algorithm, the matrix to be searched should be defined as a function, and this function is given as input to the algorithm (together with the dimensions of the matrix). The algorithm then evaluates the function whenever it needs to know the value of a particular matrix cell. For a matrix with r rows and c columns, its running time and number of function evaluations are both O(c(1 + log(r/c))), much faster than the O(rc) time of a naive algorithm that evaluates all matrix cells.The main applications of this method presented in the original paper by Aggarwal et al. were in computational geometry, in finding the farthest point from each point of a convex polygon, and in finding optimal enclosing polygons. Subsequent research found applications of the same algorithm in breaking paragraphs into lines, RNA secondary structure prediction, DNA and protein sequence alignment, the construction of prefix codes, and image thresholding, among others.".
- SMAWK_algorithm wikiPageID "40077712".
- SMAWK_algorithm wikiPageRevisionID "575795194".
- SMAWK_algorithm subject Category:Combinatorial_algorithms.
- SMAWK_algorithm subject Category:Matrix_theory.
- SMAWK_algorithm comment "The SMAWK algorithm is an algorithm for finding the minimum value in each row of an implicitly-defined totally monotone matrix. It is named after the initials of its five inventors, Peter Shor, Shlomo Moran, Alok Aggarwal, Robert Wilber, and Maria Klawe.For the purposes of this algorithm, a matrix is defined to be monotone if each row's minimum value occurs in a column which is equal to or greater than the column of the previous row's minimum.".
- SMAWK_algorithm label "SMAWK algorithm".
- SMAWK_algorithm sameAs m.0wfzg8j.
- SMAWK_algorithm sameAs Q17103377.
- SMAWK_algorithm sameAs Q17103377.
- SMAWK_algorithm wasDerivedFrom SMAWK_algorithm?oldid=575795194.
- SMAWK_algorithm isPrimaryTopicOf SMAWK_algorithm.