@conference {14897,
	title = {Space/time trade-offs for associative memory},
	booktitle = {Pattern Recognition, 1996., Proceedings of the 13th International Conference on},
	volume = {4},
	year = {1996},
	month = {1996/08//},
	pages = {296 -302 vol.4 - 296 -302 vol.4},
	abstract = {In any storage scheme, there is some trade-off between the space used (size of memory) and access time. However, the nature of this trade-off seems to depend on more than just what is being stored-it also depends the types of queries we consider. We justify this claim by considering a particular memory model and contrast recognition (membership queries) with associative recall. We show that the latter task can require exponentially larger memories even when identical information is stored},
	keywords = {access, matching;set, memory;associative, nets;pattern, processing;content-addressable, query;memory, recall;membership, scheme;associative, space;set, storage;neural, theory;, theory;storage, time;associative},
	doi = {10.1109/ICPR.1996.547434},
	author = {GROVE,A. J and Jacobs, David W.}
}
