Sciweavers

553 search results - page 15 / 111
» On Planar Path Transformation
Sort
View
ICC
2009
IEEE
14 years 2 months ago
A Laplace Transform-Based Method to Stochastic Path Finding
—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...
Suleyman Uludag, Ziyneti Elif Uludag, Klara Nahrst...
GG
2004
Springer
14 years 23 days ago
Composition of Path Transductions
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...
Tanguy Urvoy
ICIP
2005
IEEE
14 years 1 months ago
Planar homography: accuracy analysis and applications
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...
COMGEO
2006
ACM
13 years 7 months ago
Computing homotopic shortest paths efficiently
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...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw