Finding a Minimal Cover for Binary Images: An Optimal Parallel Algorithm

Algorithmica- United States

doi 10.1007/bf01759065

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Science and Business Media LLC

Related search

An Optimal Algorithm for Reconstructing Images From Binary Measurements

2010English

An Optimal Parallel Algorithm for Learning DFA

1994English

A Flexible Approach for Finding Optimal Paths With Minimal Conflicts

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

An Optimal Path Cover Algorithm for Cographs

Computers and Mathematics with Applications
MathematicsComputational MathematicsSimulationModelingComputational Theory
1995English

An Efficient Two-Scan Labeling Algorithm for Binary Hexagonal Images

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2014English

Parallel Operations on Binary Images.

1979English

Optimal Parallel Algorithms for Finding Proximate Points, With Applications

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
1998English

An Optimal Algorithm for the Minimum Disc Cover Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2007English

An Optimal Hardware-Algorithm for Sorting Using a Fixed-Size Parallel Sorting Device

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2000English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy