Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

J. Sutherland Frame

dblp:21/5818 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1975
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%

Topics — the 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Emerging computing paradigms
neural computing		 0.011975
Convergence in Iteratively Formed Correlation Matrix Memories · IEEE Trans. Computers 1975

Methods — techniques the papers use, named apart from their topics

linear independence analysis · 0.0correlation matrix memory · 0.0
YearPublicationVenuePosition
1975 Convergence in Iteratively Formed Correlation Matrix Memories
abstract
Correlation matrix memories are formed iteratively given a single cue-response pair at a time to be stored in an associative anner. If the cues presented are not orthogonal, the memory provides imperfect recollections after a single training exposure; however, if the cues are linearly independent, repetitions of the exposures can lead to ultimate perfect memorization and recollection ability.
Richard J. Reid, J. Sutherland Frame
 IEEE Trans. Computers2