Paper Info
Title
Information retrieval and the average number of input clues.
Abstract
Information retrieval in an associative memory was introduced in a recent paper by Yaakobi and Bruck. The associative memory is represented by a graph where the vertices correspond to the stored information units and the edges to associations between them. The goal is to find a stored information unit in the memory using input clues. In this paper, we study the minimum average number of input clues needed to find the sought information unit in the infinite king grid. We provide a geometric approach to determine the minimum number of input clues. Using this approach we are able to find optimal results and bounds on the number of input clues. The model by Yaakobi and Bruck has also applications to sensor networks monitoring and Levenshtein's sequence reconstruction problem.
Year
DOI
Venue
2017
10.3934/amc.2017013
ADVANCES IN MATHEMATICS OF COMMUNICATIONS
Keywords
Field
DocType
Information retrieval,associative memory,geometric method,king grid.
Graph,Content-addressable memory,Geometric method,Reconstruction problem,Vertex (geometry),Information retrieval,Theoretical computer science,Wireless sensor network,Mathematics,Grid
Journal
Volume
Issue
ISSN
11
1
1930-5346
Citations 
PageRank 
References 
0
0.34
10
Authors
1
Name
Order
Citations
PageRank
Tero Laihonen136339.39