Efficient and robust associative memory from a generalized Bloom filter (Q353819): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q50949465 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00422-012-0494-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993196049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5483032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space/time trade-offs in hash coding with allowable errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Applications of Bloom Filters: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving recall from an associative memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity and information efficiency of the associative net / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neural networks and physical systems with emergent collective computational abilities. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Less Hashing, Same Performance: Building a Better Bloom Filter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Less hashing, same performance: Building a better Bloom filter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor graphs and the sum-product algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4457477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information capacity in recurrent McCulloch–Pitts networks with sparsely coded memory states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly connected sigma–pi neurons can form associator networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624703 / rank
 
Normal rank

Latest revision as of 15:58, 6 July 2024

scientific article
Language Label Description Also known as
English
Efficient and robust associative memory from a generalized Bloom filter
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references