127 search results - page 8 / 26 » The Directed Planar Reachability Problem |
ICIP
2009
IEEE
16 years 22 days ago
2009
IEEE
This paper addresses the problem of mapping images between different vision sensors. Such a mapping could be modeled as a sampling problem that has to encompass the change of geom...
CVPR
1999
IEEE
16 years 1 months ago
1999
IEEE
We consider the problem of wrapping around an object, of which two views are available, a reference surface and recovering the resulting parametric flow using direct computations ...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
NSDI
2008
15 years 2 months ago
2008
We present Hubble, a system that operates continuously to find Internet reachability problems in which routes exist to a destination but packets are unable to reach the destinatio...
EOR
2006
14 years 11 months ago
2006
Two players are lost in a grid of city streets and wish to meet as soon as possible. Knowing only the distribution of the other's initial location (two nodes away in one of t...