Memory versus error trade-offs in binary-valued retrieval problems

DOI10.1109/TSMC.1984.6313303MaRDI QIDQ3216167zbMATH OpenOpenAlexFDO

Authors Hiroshige Inazumi, Shigeichi Hirasawa

Publication date 1984

Published in IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsmc.1984.6313303

zbMATH Keywords

drastic memory savingelasticityQuestion-answering systems

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• Fundamental limits for information retrieval
• Binary search with errors and variable cost queries
• Information retrieval with unambiguous output
• Minimum number of input clues in robust information retrieval
• Algorithms for optimization of retrieval in a distributed memory system

Cited in

(1)

• Identification Rate, Search and Memory Complexity Tradeoff: Fundamental Limits

This page was built for publication: Memory versus error trade-offs in binary-valued retrieval problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216167)