Larry Carter
Robert Floyd
ABSTRACT
In this paper we consider the question of how much space is needed to represent a set. Given a finite universe U and some subset V (called the vocabulary), an exact membership tester is a procedure that for each element s in U determines if s is in V. An approximate membership tester is allowed to make mistakes: we require that the membership tester correctly accepts every element of V, but we allow it to also accept a small fraction of the elements of U - V.
- 1.B.H. Bloom, "Space/Time Trade-offs in Hash Coding with Allowable Errors," Comm. ACM 13 (1970), pp. 422-426. Google Scholar
Digital Library
- 2.J.L. Carter & M.N. Wegman, "Universal Classes of Hash Functions,&rdquo Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, May, 1977, pp. 106-112. Google ScholarDigital Library
- 3.G.J. Chaitin, "On the Length of Programs for Computing Finite Binary Sequences," Journal Assoc. Comput. Mach. 13 (1966), pp. 547-569. Google ScholarDigital Library
- 4.G.J. Chaitin, "A Theory of Program Size Formally Identical to Information Theory," Journal Assoc. Comput. Mach. 22 (1975), pp. 329-340. Google ScholarDigital Library
- 5.P. Erdös and J. Spencer,Probabilistic Methods in Combinatorics, Chapter 13, Academic Press, New York, 1974.Google Scholar
- 6.R.G. Gallager,Information Theory and Reliable Communication, Wiley, New York, 1968. Google ScholarDigital Library
- 7.J. Gill, "Computational Complexity of Probabilistic Turing Machines," SIAM Journal on Computing 6 (1977), pp. 675-695.Google ScholarDigital Library
- 8.D.A. Huffman, "A Method for the Construction of Minimum Redundancy Codes," Proc. IRE 40 (1952), pp. 1098-1101.Google ScholarCross Ref
- 9.A.N. Kolmogorov, "Three Approaches to the Definition of the Concept 'Quantity of Information'," Probl.Pederachi Inform. 1.(1965), pp. 3-11.Google Scholar
- 10.M.O. Rabin, "Probabilistic Algorithms," Algorithms and Complexity: New Directions and Recent Results, J.F. Traub, ed., Academic Press, New York, 1976, pp. 21-40.Google Scholar
- 11.W.S. Rosenbaum and J.J. Hilliard, "Multifont OCR Postprocessing System," IBM Journal of Research and Development 19 (1975), pp. 398-421.Google ScholarDigital Library
Index Terms
- Exact and approximate membership testers
Recommendations
Semi-elliptic membership function
A potentially important, yet under-stated membership function (MF) shape viz. semi-elliptic membership function (SEMF) has been elaborated in this paper so that researchers are able to see its true potential for realistic modelling of the decision ...
Interval type-2 fuzzy membership function generation methods for pattern recognition
Type-2 fuzzy sets (T2 FSs) have been shown to manage uncertainty more effectively than T1 fuzzy sets (T1 FSs) in several areas of engineering [4,6-12,15-18,21-27,30]. However, computing with T2 FSs can require undesirably large amount of computations ...
Intuitionistic Fuzzy Finite Automata with Unique Membership Transitions
ITA '13: Proceedings of the 2013 International Conference on Information Technology and ApplicationsIntuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata are discussed. The notions of intuitionistic fuzzy finite automata with unique transition on an input symbol is introduced. It is shown that for any intuitionistic fuzzy finite ...
Comments