—Finding the most likely path satisfying a requested additive Quality-of-Service (QoS) value, such as delay, when link metrics are defined as random variables by known probabili...
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
Projective homography sits at the heart of many problems in image registration. In addition to many methods for estimating the homography parameters [5], analytical expressions to...
Shahriar Negahdaripour, Ricard Prados, Rafael Garc...
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...