Content-Addressable Memories: Springer Series in Information Sciences, cartea 1
Autor Teuvo Kohonenen Limba Engleză Paperback – 16 apr 1987
Din seria Springer Series in Information Sciences
- 18% Preț: 927.66 lei
- 15% Preț: 628.11 lei
- 20% Preț: 327.89 lei
- Preț: 374.65 lei
- Preț: 371.11 lei
- Preț: 380.47 lei
- 20% Preț: 315.40 lei
- Preț: 370.01 lei
- 18% Preț: 755.40 lei
- Preț: 376.93 lei
- Preț: 385.32 lei
- 20% Preț: 321.33 lei
- Preț: 371.70 lei
- 15% Preț: 623.79 lei
- 15% Preț: 621.74 lei
- Preț: 376.55 lei
- 20% Preț: 323.90 lei
- Preț: 375.97 lei
- 20% Preț: 634.98 lei
- 15% Preț: 642.08 lei
- 18% Preț: 1351.22 lei
- 15% Preț: 620.15 lei
- 15% Preț: 624.28 lei
- Preț: 375.03 lei
- 20% Preț: 630.99 lei
- 18% Preț: 922.94 lei
- Preț: 382.16 lei
- 20% Preț: 633.72 lei
- 20% Preț: 627.14 lei
- Preț: 379.14 lei
- Preț: 376.93 lei
- 15% Preț: 564.33 lei
Preț: 328.04 lei
Preț vechi: 410.05 lei
-20% Nou
Puncte Express: 492
Preț estimativ în valută:
62.78€ • 65.83$ • 52.35£
62.78€ • 65.83$ • 52.35£
Carte tipărită la comandă
Livrare economică 07-21 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540176251
ISBN-10: 354017625X
Pagini: 404
Ilustrații: XIII, 388 p. 2 illus.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.56 kg
Ediția:2. Auflage.
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Springer Series in Information Sciences
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354017625X
Pagini: 404
Ilustrații: XIII, 388 p. 2 illus.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.56 kg
Ediția:2. Auflage.
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Springer Series in Information Sciences
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
GraduateCuprins
1 Associative Memory, Content Addressing, and Associative Recall.- 1.1 Introduction.- 1.2 The Two Basic Implementations of Content Addressing.- 1.3 Associations.- 1.4 Associative Recall: Extensions of Concepts.- 2 Content Addressing by Software.- 2.1 Hash Coding and Formatted Data Structures.- 2.2 Hashing Functions.- 2.3 Handling of Collisions.- 2.4 Organizational Features and Formats of Hash Tables.- 2.5 Evaluation of Different Schemes in Hash Coding.- 2.6 Multi-Key Search.- 2.7 Implementation of Proximity Search by Hash Coding.- 2.8 The TRIE Memory.- 2.9 Survey of Literature on Hash Coding and Related Topics.- 3 Logic Principles of Content-Addressable Memories.- 3.1 Present-Day Needs for Hardware CAMs.- 3.2 The Logic of Comparison Operations.- 3.3 The All-Parallel CAM.- 3.4 The Word-Parallel, Bit-Serial CAM.- 3.5 The Word-Serial, Bit-Parallel CAM.- 3.6 Byte-Serial Content-Addressable Search.- 3.7 Functional Memories.- 3.8 A Formalism for the Description of Micro-Operations in the CAM.- 3.9 Survey of Literature on CAMs.- 4 CAM Hardware.- 4.1 The State-of-the-Art of the Electronic CAM Devices.- 4.2 Circuits for All-Parallel CAMs.- 4.3 Circuits for Bit-Serial and Word-Serial CAMs.- 4.4 Optical Content-Addressable Memories.- 5 The CAM as a System Part.- 5.1 The CAM in Virtual Memory Systems.- 5.2 Utilization of the CAM in Dynamic Memory Allocation.- 5.3 Content-Addressable Buffer.- 5.4 Programmable Logic.- 6 Content-Addressable Processors.- 6.1. Some Trends in Content-Addressable Memory Functions.- 6.2 Distributed-Logic Memories (DLMs).- 6.3 The Augmented Content-Addressable Memory (ACAM).- 6.4 The Association-Storing Processor (ASP).- 6.5 Content-Addressable Processors with High-Level Processing Elements.- 6.6 Bit-Slice Content-Addressable Processors.- 6.7 An Overview ofParallel Processors.- 7 Review of Research Since 1979.- 7.1 Research on Hash Coding.- 7.2 CAM Hardware.- 7.3 CAM Applications.- 7.4 Content-Addressable Parallel Processors.- 7.5 Optical Associative Memories.- References.