• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 27,746
Next 10 →

Why there are complementary learning systems in the hippocampus and neocortex: insights from the successes and failures of connectionist models of learning and memory

by James L. McClelland, Bruce L. McNaughton, Randall C. O'Reilly , 1995
"... Damage to the hippocampal system disrupts recent memory but leaves remote memory intact. The account presented here suggests that memories are first stored via synaptic changes in the hippocampal system, that these changes support reinstatement of recent memories in the neocortex, that neocortical s ..."
Abstract - Cited by 675 (39 self) - Add to MetaCart
with learning about other items. This suggests that the neocortex learns slowly to discover the structure in ensembles of experiences. The hippocampal system permits rapid learning of new items without disrupting this structure, and reinstatement of new memories interleaves them with others to integrate them

The geometry of algorithms with orthogonality constraints

by Alan Edelman, Tomás A. Arias, Steven T. Smith - SIAM J. MATRIX ANAL. APPL , 1998
"... In this paper we develop new Newton and conjugate gradient algorithms on the Grassmann and Stiefel manifolds. These manifolds represent the constraints that arise in such areas as the symmetric eigenvalue problem, nonlinear eigenvalue problems, electronic structures computations, and signal proces ..."
Abstract - Cited by 640 (1 self) - Add to MetaCart
processing. In addition to the new algorithms, we show how the geometrical framework gives penetrating new insights allowing us to create, understand, and compare algorithms. The theory proposed here provides a taxonomy for numerical linear algebra algorithms that provide a top level mathematical view

SELF: The power of simplicity

by David Ungar, Randall B. Smith , 1991
"... SELF is an object-oriented language for exploratory programming based on a small number of simple and concrete ideas: prototypes, slots, and behavior. Prototypes combine inheritance and instantiation to provide a framework that is simpler and more flexible than most object-oriented languages. Slots ..."
Abstract - Cited by 640 (19 self) - Add to MetaCart
, and closures. SELF’s simplicity and expressiveness offer new insights into objectoriented computation.

Compressive sampling

by Emmanuel J. Candès , 2006
"... Conventional wisdom and common practice in acquisition and reconstruction of images from frequency data follow the basic principle of the Nyquist density sampling theory. This principle states that to reconstruct an image, the number of Fourier samples we need to acquire must match the desired res ..."
Abstract - Cited by 1441 (15 self) - Add to MetaCart
mathematical insights underlying this new theory, and explain some of the interactions between compressive sampling and other fields such as statistics, information theory, coding theory, and theoretical computer science.

Alliances and networks

by Ranjay Gulati
"... This paper introduces a social network perspective to the study of strategic alliances. It extends prior research, which has primarily considered alliances as dyadic exchanges and paid less attention to the fact that key precursors, processes, and outcomes associated with alliances can be defined an ..."
Abstract - Cited by 833 (6 self) - Add to MetaCart
) the performance consequences for firms entering alliances. For each of these issues, this paper outlines some of the current research and debates at the firm and dyad level and then discusses some of the new and important insights that result from introducing a network perspective. It highlights current network

OPTICS: Ordering Points To Identify the Clustering Structure

by Mihael Ankerst, Markus M. Breunig, Hans-peter Kriegel, Jörg Sander , 1999
"... Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysis and data processing, or as a preprocessing step for other algorithms operating on the detected clusters. Almost all of ..."
Abstract - Cited by 527 (51 self) - Add to MetaCart
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysis and data processing, or as a preprocessing step for other algorithms operating on the detected clusters. Almost all

Understanding Normal and Impaired Word Reading: Computational Principles in Quasi-Regular Domains

by David C. Plaut , James L. McClelland, Mark S. Seidenberg, Karalyn Patterson - PSYCHOLOGICAL REVIEW , 1996
"... We develop a connectionist approach to processing in quasi-regular domains, as exemplified by English word reading. A consideration of the shortcomings of a previous implementation (Seidenberg & McClelland, 1989, Psych. Rev.) in reading nonwords leads to the development of orthographic and phono ..."
Abstract - Cited by 613 (94 self) - Add to MetaCart
and phonological representations that capture better the relevant structure among the written and spoken forms of words. In a number of simulation experiments, networks using the new representations learn to read both regular and exception words, including low-frequency exception words, and yet are still able

Robust face recognition via sparse representation

by John Wright, Allen Y. Yang, Arvind Ganesh, S. Shankar Sastry, Yi Ma - IEEE TRANS. PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 2008
"... We consider the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise. We cast the recognition problem as one of classifying among multiple linear regression models, and argue that new theory from sparse signa ..."
Abstract - Cited by 936 (40 self) - Add to MetaCart
signal representation offers the key to addressing this problem. Based on a sparse representation computed by ℓ 1-minimization, we propose a general classification algorithm for (image-based) object recognition. This new framework provides new insights into two crucial issues in face recognition: feature

Typesetting Concrete Mathematics

by Donald E. Knuth - TUGBOAT , 1989
"... ... tried my best to make the book mathematically interesting, but I also knew that it would be typographically interesting-because it would be the first major use of a new typeface by Hermann Zapf, commissioned by the American Mathematical Society. This typeface, called AMS Euler, had been carefull ..."
Abstract - Cited by 661 (1 self) - Add to MetaCart
... tried my best to make the book mathematically interesting, but I also knew that it would be typographically interesting-because it would be the first major use of a new typeface by Hermann Zapf, commissioned by the American Mathematical Society. This typeface, called AMS Euler, had been

The scanning model for translation: An update

by Marilyn Kozak - J Cell Biol , 1989
"... Abstract. The small (40S) subunit of eukaryotic ribo-somes is believed to bind initially at the capped 5'-end of messenger RNA and then migrate, stopping at the first AUG codon in a favorable context for initiating translation. The first-AUG rule is not absolute, but T HE scanning mechanism for ..."
Abstract - Cited by 496 (0 self) - Add to MetaCart
for initiation of translation in eukaryotes was proposed 10 years ago (112). Support-ing evidence has accumulated at a slower rate than one might have wished, but a trickle sustained over 10 yr forms a decent-sized pond. Some remarkable experiments now be-ing carried out in yeasts are yielding important new
Next 10 →
Results 1 - 10 of 27,746
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University