On data retrieval from unambiguous bit matrices
From MaRDI portal
Publication:4055174
DOI10.1007/BF00976242zbMATH Open0301.68040MaRDI QIDQ4055174FDOQ4055174
Authors:
Publication date: 1975
Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)
General topics in the theory of software (68N01) Information storage and retrieval of data (68P20) Algorithms in computer science (68W99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The reconstruction of binary patterns from their projections
- Title not available (Why is that?)
- Reconstruction of pictures from their projections
- Title not available (Why is that?)
- Pseudo-Boolean methods for bivalent programming. Lecture at the first European meeting of the Institute of Management Sciences and of the Econometric Society, Warsaw, September 2--7, 1966
- Bibliography on data compression, picture properties, and picture coding
Cited In (1)
This page was built for publication: On data retrieval from unambiguous bit matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4055174)