An Algorithm for Fast Recognition of Connected Row-Convex Constraint Networks.
Enhong ChenZhenya ZhangXufa WangKazuyuki AiharaPublished in: JFPLC (2001)
Keyphrases
- recognition algorithm
- dynamic programming
- constraint networks
- np hard
- object recognition
- simulated annealing
- objective function
- convex constraints
- computational complexity
- expectation maximization
- linear programming
- complexity bounds
- tree decomposition
- constraint programming
- temporal information
- worst case
- optimal solution