Information retrieval and the average number of input clues

DOI10.3934/AMC.2017013MaRDI QIDQ514538zbMATH OpenOpenAlexFDO

Authors Tero Laihonen

Publication date 9 March 2017

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/amc.2017013

zbMATH Keywords

associative memorygeometric methodinformation retrievalking grid

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Minimum number of input clues in robust information retrieval
• Information retrieval with unambiguous output
• Information storage and search complexity theory
• Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory
• Fundamental limits for information retrieval

Cites work

• Adaptive identification in Torii in the King lattice
• Codes for Information Retrieval With Small Uncertainty
• Connected Identifying Codes
• Extremal graphs for the identifying code problem
• Information retrieval with unambiguous output
• Information Retrieval With Varying Number of Input Clues
• New results on variants of covering codes in Sierpiński graphs
• On a new class of codes for identifying vertices in graphs
• On codes identifying vertices in the two-dimensional square lattice with diagonals
• The minimum density of an identifying code in the king lattice.
• Vertex identifying codes for fault isolation in communication networks
• Watching systems in the King grid

Cited in

(4)

• On t-revealing codes in binary Hamming spaces
• Information retrieval with unambiguous output
• Locating-domination and identification
• Minimum number of input clues in robust information retrieval

This page was built for publication: Information retrieval and the average number of input clues

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