Parallel consistent labeling algorithms (Q1104118): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency in networks of relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks of constraints: Fundamental properties and applications to picture processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Efficiency of Backtrack Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction operations for constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scene Labeling by Relaxation Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time Bounded Random Access Machines with Parallel Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network-based heuristics for constraint-satisfaction problems / rank
 
Normal rank

Latest revision as of 16:40, 18 June 2024

scientific article
Language Label Description Also known as
English
Parallel consistent labeling algorithms
scientific article

    Statements

    Parallel consistent labeling algorithms (English)
    0 references
    0 references
    0 references
    1987
    0 references
    inherent parallelism
    0 references
    computer vision algorithms
    0 references
    node consistency
    0 references
    arc consistency
    0 references
    parallel complexity
    0 references
    Butterfly mircoprocessor
    0 references
    constraint satisfaction algorithm
    0 references
    consistent labeling
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references