Results 11 - 20 of 18,436

A model for Pavlovian learning: Variations in the effectiveness of conditioned but not of unconditioned stimuli

by John M. Pearce - Psychological Review , 1980
"... Several formal models of excitatory classical conditioning are reviewed. It is suggested that a central problem for all of them is the explanation of cases in which learning does not occur in spite of the fact that the conditioned stimulus is a signal for the reinforcer. We propose a new model that ..."
Abstract - Cited by 290 (11 self) - Add to MetaCart
Several formal models of excitatory classical conditioning are reviewed. It is suggested that a central problem for all of them is the explanation of cases in which learning does not occur in spite of the fact that the conditioned stimulus is a signal for the reinforcer. We propose a new model

Analog-to-digital converter survey and analysis

by Robert H. Walden - IEEE Journal on Selected Areas in Communications , 1999
"... Abstract—Analog-to-digital converters (ADC’s) are ubiquitous, critical components of software radio and other signal processing systems. This paper surveys the state-of-the-art of ADC’s, including experimental converters and commercially available parts. The distribution of resolution versus samplin ..."
Abstract - Cited by 263 (0 self) - Add to MetaCart
sampling frequency over the last six–eight years. Index Terms—Analog-to-digital converters, aperture jitter, comparator ambiguity, input-referred noise, signal-to-noise ratio, spurious-free dynamic range. I.

Get Another Label? Improving Data Quality and Data Mining Using Multiple, Noisy Labelers

by Victor S. Sheng, Foster Provost, Panagiotis G. Ipeirotis
"... This paper addresses the repeated acquisition of labels for data items when the labeling is imperfect. We examine the improvement (or lack thereof) in data quality via repeated labeling, and focus especially on the improvement of training labels for supervised induction. With the outsourcing of smal ..."
Abstract - Cited by 252 (12 self) - Add to MetaCart
This paper addresses the repeated acquisition of labels for data items when the labeling is imperfect. We examine the improvement (or lack thereof) in data quality via repeated labeling, and focus especially on the improvement of training labels for supervised induction. With the outsourcing

Scale-free networks in cell biology

by Réka Albert - JOURNAL OF CELL SCIENCE
"... A cell’s behavior is a consequence of the complex interactions between its numerous constituents, such as DNA, RNA, proteins and small molecules. Cells use signaling pathways and regulatory mechanisms to coordinate multiple processes, allowing them to respond to and adapt to an ever-changing environ ..."
Abstract - Cited by 203 (6 self) - Add to MetaCart
A cell’s behavior is a consequence of the complex interactions between its numerous constituents, such as DNA, RNA, proteins and small molecules. Cells use signaling pathways and regulatory mechanisms to coordinate multiple processes, allowing them to respond to and adapt to an ever

Computational Limitations on Learning from Examples

by Leonard Pitt, Leslie G. Valiant - Journal of the ACM , 1988
"... Abstract. The computational complexity of learning Boolean concepts from examples is investigated. It is shown for various classes of concept representations that these cannot be learned feasibly in a distribution-free sense unless R = NP. These classes include (a) disjunctions of two monomials, (b) ..."
Abstract - Cited by 214 (10 self) - Add to MetaCart
Abstract. The computational complexity of learning Boolean concepts from examples is investigated. It is shown for various classes of concept representations that these cannot be learned feasibly in a distribution-free sense unless R = NP. These classes include (a) disjunctions of two monomials, (b

Petrify: a tool for manipulating concurrent specifications and . . .

by Jordi Cortadella, et al.
"... Petrify is a tool for (1) manipulating concurrent specifications and (2) synthesis and optimization of asynchronous control circuits. Given a Petri Net (PN), a Signal Transition Graph (STG), or a Transition System (TS) 1 it (1) generates another PN or STG which is simpler than the original descripti ..."
Abstract - Cited by 219 (34 self) - Add to MetaCart
Petrify is a tool for (1) manipulating concurrent specifications and (2) synthesis and optimization of asynchronous control circuits. Given a Petri Net (PN), a Signal Transition Graph (STG), or a Transition System (TS) 1 it (1) generates another PN or STG which is simpler than the original

The Utility of Knowledge in Inductive Learning

by Michael Pazzani, Dennis Kibler , 1992
"... In this paper, we demonstrate how different forms of background knowledge can be integrated with an inductive method for generating constant-free Horn clause rules. Furthermore, we evaluate, both theoretically and empirically, the effect that these types of knowledge have on the cost of learning a r ..."
Abstract - Cited by 154 (22 self) - Add to MetaCart
In this paper, we demonstrate how different forms of background knowledge can be integrated with an inductive method for generating constant-free Horn clause rules. Furthermore, we evaluate, both theoretically and empirically, the effect that these types of knowledge have on the cost of learning a

Automatic Grammar Induction and Parsing Free Text: A Transformation-Based Approach

by Eric Brill - IN PROCEEDINGS OF THE 31ST ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS , 1993
"... In this paper we describe a new technique for parsing free text: a transformational grammar is automatically learned that is capable of accurately parsing text into binary-branching syntactic trees with nonterminals unlabelled. The algorithm works by beginning in a very naive state of knowledge abo ..."
Abstract - Cited by 137 (8 self) - Add to MetaCart
In this paper we describe a new technique for parsing free text: a transformational grammar is automatically learned that is capable of accurately parsing text into binary-branching syntactic trees with nonterminals unlabelled. The algorithm works by beginning in a very naive state of knowledge

Costly signalling and cooperation

by Eric Smith, Samuel Bowles, Herbert Gintis, Robert Boyd, Steven Frank, Peter Richerson, Steven Siller - Journal of Theoretical Biology , 2001
"... We propose an explanation of cooperation among unrelated members of a social group, in which providing group benefits evolves because it constitutes an honest signal of the member’s quality as a mate, coalition partner or competitor, and therefore results in advantageous alliances for those signalin ..."
Abstract - Cited by 148 (9 self) - Add to MetaCart
individually consumable resources, participating in group raiding or defense, and punishing free-riding or other violations of social norms. Our signaling model is distinctive in applying to group rather than dyadic interactions and in determining endogenously the fraction of the group that signals high

Words and voices: Episodic traces in spoken word identification and recognition memory

by Stephen D. Goldinger - J. Exp. Psych: Learn., Mem., & Cog , 1996
"... Most theories of spoken word identification assume that variable speech signals are matched to canonical representations in memory. To achieve this, idiosyncratic voice details are first normalized, allowing direct comparison of the input to the lexicon. This investigation assessed both explicit and ..."
Abstract - Cited by 192 (6 self) - Add to MetaCart
Most theories of spoken word identification assume that variable speech signals are matched to canonical representations in memory. To achieve this, idiosyncratic voice details are first normalized, allowing direct comparison of the input to the lexicon. This investigation assessed both explicit
Results 11 - 20 of 18,436