Navigation

  • index
  • next |
  • previous |
  • Sparse Distributed Memory Framework documentation »

3. Examples¶

  • 3.1. Distance between bitstrings
  • 3.2. Generates a new SDM
  • 3.3. Kanerva’s Figure 1.2 (page 25)
  • 3.4. Kanerva’s Table 7.3 (page 70)
  • 3.5. Noise filter
  • 3.6. Classification Test #1
  • 3.7. Classification Test #2
  • 3.8. Classification Test #3
    • 3.8.1. Generating labels
    • 3.8.2. Training the SDM
    • 3.8.3. Testing with high noise
    • 3.8.4. Testing with low noise
    • 3.8.5. Testing with no noise

Previous topic

2. C API

Next topic

3.1. Distance between bitstrings

Quick search

Navigation

  • index
  • next |
  • previous |
  • Sparse Distributed Memory Framework documentation »
© Copyright 2018, Alexandre Linhares, Marcelo Salhab Brogliato. Created using Sphinx 1.7.4.