Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996
This paper proposes a family of new methods for the storage and reconstruction of binary patterns by means of block-projections. More flexibility and less ambiguity is thus achieved. A complete analysis is presented in terms of (i) storage requirements, (ii) computation, and (iii) unambiguity ratio. Furthermore, applications to general patterns are described. © 1972 American Elsevier Publishing Company, Inc. All rights reserved.
Joseph Y. Halpern
aaai 1996
Zahra Ashktorab, Djallel Bouneffouf, et al.
IJCAI 2025
Shai Fine, Yishay Mansour
Machine Learning
David Carmel, Haggai Roitman, et al.
ACM TIST