73 search results - page 7 / 15 » Random Walk on Directed Dynamic Graphs |
COMGEO
1999
ACM
13 years 9 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
Reinforcement Learning research is traditionally devoted to solve single-task problems. Therefore, anytime a new task is faced, learning must be restarted from scratch. Recently, ...
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
This paper introduces an algorithm for detecting walking
motion using point trajectories in video sequences. Given
a number of point trajectories, we identify those which are
sp...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
ESA
2004
Springer
14 years 3 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...