Information retrieval and the average number of input clues
From MaRDI portal
Publication:514538
DOI10.3934/AMC.2017013zbMATH Open1404.68039OpenAlexW2588773401MaRDI QIDQ514538FDOQ514538
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
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
Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- On a new class of codes for identifying vertices in graphs
- Extremal graphs for the identifying code problem
- The minimum density of an identifying code in the king lattice.
- Information retrieval with unambiguous output
- Watching systems in the King grid
- New results on variants of covering codes in Sierpiński graphs
- Information Retrieval With Varying Number of Input Clues
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- Vertex identifying codes for fault isolation in communication networks
- Connected Identifying Codes
- Codes for Information Retrieval With Small Uncertainty
- Adaptive identification in Torii in the King lattice
Cited In (2)
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)
