Sciweavers

2834 search results - page 2 / 567
» Representing Trees with Constraints
Sort
View
CP
2000
Springer
13 years 8 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
ECAI
2004
Springer
13 years 10 months ago
Adversarial Constraint Satisfaction by Game-Tree Search
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
Kenneth N. Brown, James Little, Páidí...
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 2 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
ICDE
2006
IEEE
146views Database» more  ICDE 2006»
13 years 11 months ago
Model Video Semantics with Constraints Considering Temporal Structure and Typed Events
The advances of video technology and video-related applications demand appropriate video semantic models for representing video data and their semantics, and supporting powerful s...
Yu Wang, Lizhu Zhou, Jianyong Wang
ALGORITHMICA
2005
97views more  ALGORITHMICA 2005»
13 years 5 months ago
Representing Trees of Higher Degree
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...
David Benoit, Erik D. Demaine, J. Ian Munro, Rajee...