Paper Info
Title
A Dynamic Programming Solution to the Monotonic Path of Minimal Cost in a 3-Rows Matrix.
Abstract
We consider the problem of finding the path of minimal cost going from left to right in a 3-rows matrix, starting at the third row, and not going downwards, where there is an additional cost related to not changing rows, such that the higher the change in intensity within the row, the higher the cost of not moving upwards.
Year
Venue
Field
2013
arXiv: Data Structures and Algorithms
Row,Discrete mathematics,Monotonic function,Dynamic programming,Combinatorics,Matrix (mathematics),Mathematics
DocType
Volume
Citations 
Journal
abs/1310.4541
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Marcelo Cicconet1287.08
Davi Geiger21050353.66