On the parallel complexity of discrete relaxation in constraint satisfaction networks

Artificial Intelligence

Volumn 45, Issue 3, 1990, Pages 275-286

  Kasif, Simon ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; EXPERT SYSTEMS--KNOWLEDGE BASES; IMAGE PROCESSING--IMAGE CODING;

CONSTRAINT SATISFACTION NETWORKS; IMAGE UNDERSTANDING; KNOWLEDGE REPRESENTATION;

ARTIFICIAL INTELLIGENCE;

EID: 0025508493     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(90)90009-O     Document Type: Article

References (19)

1. MSYS: A system for reasoning about scenes
2. Constraint satisfaction from a deductive viewpoint
3. Symbolic reasoning among 3-D models and 2-D images
4. A unified approach to models of synchronous parallel machines
5. The consistent labeling problem Part I
6. Complete problems for deterministic polynomial time
7. Parallel solution for constraint satisfaction problems
8. The fixpoints of images and scenes
9. Relaxation applied to matching quantitative relational structures
10. Consistency in networks of relations
11. The complexity of some polynomial network consistency algorithms for constraint satisfaction
12. Scene labeling by relaxation operations
13. Parallel consistent labelling algorithms
14. Understanding line drawings of scenes with shadows