Sciweavers

2834 search results - page 3 / 567
» Representing Trees with Constraints
Sort
View
AMAI
1999
Springer
13 years 6 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
ICCV
2005
IEEE
14 years 8 months ago
Beyond Trees: Common-Factor Models for 2D Human Pose Recovery
Tree structured models have been widely used for determining the pose of a human body, from either 2D or 3D data. While such models can effectively represent the kinematic constra...
Xiangyang Lan, Daniel P. Huttenlocher
SAC
2000
ACM
13 years 11 months ago
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
Günther R. Raidl, Bryant A. Julstrom
ESANN
2006
13 years 8 months ago
Unsupervised clustering of continuous trajectories of kinematic trees with SOM-SD
We explore the capability of the Self Organizing Map for structured data (SOM-SD) to compress continuous time data recorded from a kinematic tree, which can represent a robot or an...
Jochen J. Steil, Risto Koiva, Alessandro Sperduti
ACTA
2010
191views more  ACTA 2010»
13 years 7 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar