Sciweavers

702 search results - page 37 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
PLDI
2004
ACM
15 years 5 months ago
Cost effective dynamic program slicing
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
Xiangyu Zhang, Rajiv Gupta
81
Voted
CVPR
2010
IEEE
15 years 8 months ago
Disambiguating Visual Relations Using Loop Constraints
Repetitive and ambiguous visual structures in general pose a severe problem in many computer vision applications. Identification of incorrect geometric relations between images s...
Christopher Zach, Manfred Klopschitz, Marc Pollefe...
ECAI
2010
Springer
15 years 27 days ago
Sound and Complete Landmarks for And/Or Graphs
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
Emil Keyder, Silvia Richter, Malte Helmert
DEXA
2003
Springer
113views Database» more  DEXA 2003»
15 years 5 months ago
Termination Analysis of Active Rules with Priorities
This paper presents an algorithm for termination static analysis of active rules with priorities. Active rules termination is an undecidable problem. Several recent works have sugg...
Alain Couchot
AROBOTS
2011
14 years 6 months ago
Human motion database with a binary tree and node transition graphs
— Database of human motion has been widely used for recognizing human motion and synthesizing humanoid motions. In this paper, we propose a data structure for storing and extract...
Katsu Yamane, Yoshifumi Yamaguchi, Yoshihiko Nakam...