Sciweavers

666 search results - page 97 / 134
» Unbalanced Graph Cuts
Sort
View
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
14 years 10 months ago
A fast algorithm for computing steiner edge connectivity
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 ...
Richard Cole, Ramesh Hariharan
EUROGRAPHICS
2010
Eurographics
14 years 6 months ago
Bidirectional Search for Interactive Motion Synthesis
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 ...
Wan-Yen Lo and Matthias Zwicker
ICRA
2006
IEEE
124views Robotics» more  ICRA 2006»
14 years 4 months ago
Stereo based Obstacle Detection for an Unmanned Air Vehicle
— 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...
Jeffrey Byrne, Martin Cosgrove, Raman K. Mehra
EDCC
2005
Springer
14 years 3 months ago
Structure-Based Resilience Metrics for Service-Oriented Networks
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...
EMMCVPR
2001
Springer
14 years 2 months ago
Grouping with Directed Relationships
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...
Stella X. Yu, Jianbo Shi