Sciweavers

1420 search results - page 137 / 284
» Representation of Graphs by OBDDs
Sort
View
AAAI
2008
15 years 9 months ago
Fast Planning by Search in Domain Transition Graph
Recent advances in classical planning have used the SAS+ formalism, and several effective heuristics have been developed based on the SAS+ formalism. Comparing to the traditional ...
Yixin Chen, Ruoyun Huang, Weixiong Zhang
APN
2008
Springer
15 years 8 months ago
MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...
Kais Klai, Denis Poitrenaud
ICRA
2010
IEEE
170views Robotics» more  ICRA 2010»
15 years 5 months ago
Categorizing object-action relations from semantic scene graphs
— In this work we introduce a novel approach for detecting spatiotemporal object-action relations, leading to both, action recognition and object categorization. Semantic scene g...
Eren Erdal Aksoy, Alexey Abramov, Florentin Wö...
CVPR
2009
IEEE
17 years 1 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
ICCV
2009
IEEE
1136views Computer Vision» more  ICCV 2009»
16 years 11 months ago
Robust Graph-Cut Scene Segmentation and Reconstruction for Free-Viewpoint Video of Complex Dynamic Scenes
Current state-of-the-art image-based scene reconstruction techniques are capable of generating high-fidelity 3D models when used under controlled capture conditions. However, th...
Jean-Yves Guillemaut, Joe Kilner and Adrian Hilton