Name
Abstract | ||
|---|---|---|
Question-answering systems have been studied from the viewpoint of achieving drastic savings of storage with a small error tolerance. A system is called elastic if a drastic memory saving may be achieved by tolerating a low level of indefiniteness of the answer. A necessary condition for the system to be elastic is that the query sets exhibit diverging redundancy. In the binary-valued retrieval problems discussed by P. Elias and R.A. Flower (1975), a system that admits the set of all binary questions regarding an arbitrary binary data with the highest redundance has been shown to be inelastic. On the other hand, a system that admits the exact match question set regarding an arbitrary binary data with the second highest redundancy is found to be elastic. |
Year | DOI | Venue |
|---|---|---|
1984 | 10.1109/TSMC.1984.6313303 | IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS |
Keywords | Field | DocType |
information retrieval,redundancy,database theory | Computer science,Error tolerance,Triple modular redundancy,Redundancy (engineering),Trade offs,Artificial intelligence,Binary data,Database theory,Machine learning,Binary number | Journal |
Volume | Issue | ISSN |
14 | 5 | 0018-9472 |
Citations | PageRank | References |
2 | 0.45 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| H. Inazumi | 1 | 92 | 13.83 |
| Shigeichi Hirasawa | 2 | 322 | 150.91 |