Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
— This paper presents the Visual Threat Awareness (VISTA) system for real time collision obstacle detection for an unmanned air vehicle (UAV). Computational stereo performance ha...
Many governmental agencies and businesses organizations use networked systems to provide a number of services. Such a service-oriented network can be implemented as an overlay on ...
Daniel J. Rosenkrantz, Sanjay Goel, S. S. Ravi, Ja...
Abstract. Grouping is a global partitioning process that integrates local cues distributed over the entire image. We identify four types of pairwise relationships, attraction and r...