108 search results - page 12 / 22 » Constant-Work-Space Algorithm for a Shortest Path in a Simpl... |
CVPR
2011
IEEE
13 years 5 months ago
2011
IEEE
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
ICC
2011
IEEE
12 years 7 months ago
2011
IEEE
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
WSDM
2010
ACM
14 years 5 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
ACRI
2006
Springer
14 years 1 months ago
2006
Springer
This paper propose a maze routing algorithm based on cellular automata. The aim of this algorithm is find the shortest path between the source cell and the target cell , so that th...