127 search results - page 5 / 26 » The Directed Planar Reachability Problem |
97
Voted
FCS
2006
15 years 1 months ago
2006
The problem of finding a negative cycle in a weighted, directed graph is discussed here. First the algorithm for printing out a negative cycle reachable from the source s, with th...
78
Voted
WADS
2001
Springer
15 years 4 months ago
2001
Springer
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
75
Voted
ACCV
2010
Springer
14 years 6 months ago
2010
Springer
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...
89
Voted
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Projector-camera systems use computer vision to analyze their surroundings and display feedback directly onto real world objects, as embodied by spatial augmented reality. To be e...
84
Voted
ATVA
2010
Springer
15 years 24 days ago
2010
Springer
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...