88 search results - page 3 / 18 » A new approach to dynamic all pairs shortest paths |
ICIAP
2003
ACM
14 years 5 months ago
2003
ACM
A novel approach is presented to select multiple key frames within an isolated video shot where there is camera motion causing significant scene change. This is achieved by determ...
TALG
2010
13 years 4 months ago
2010
We present two new algorithms for finding optimal strategies for discounted, infinite-horizon, Deterministic Markov Decision Processes (DMDP). The first one is an adaptation of...
ALGORITHMICA
2011
13 years 25 days ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
COMGEO
2007
ACM
13 years 5 months ago
2007
ACM
Given two points on a closed planar curve, C, we can divide the length of a shortest connecting path in C by their Euclidean distance. The supremum of these ratios, taken over all...
SIGMOD
2009
ACM
14 years 6 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...