Results 1  10
of
567,598
Learning a Subclass of Regular Patterns in Polynomial Time
, 2007
"... An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1... αmxm, where x0,..., xm are variables and α1,..., αm strings of terminals of length c each, it runs with arbitrarily high probabi ..."
Abstract
 Add to MetaCart
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1... αmxm, where x0,..., xm are variables and α1,..., αm strings of terminals of length c each, it runs with arbitrarily high
Learning a Subclass of Regular Patterns in Polynomial Time
"... An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns pi of the form x0α1x1... αmxm, where x0,..., xm are variables and α1,..., αm strings of terminals of length c each, it runs with arbitrarily high proba ..."
Abstract
 Add to MetaCart
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns pi of the form x0α1x1... αmxm, where x0,..., xm are variables and α1,..., αm strings of terminals of length c each, it runs with arbitrarily high
Locally weighted learning
 ARTIFICIAL INTELLIGENCE REVIEW
, 1997
"... This paper surveys locally weighted learning, a form of lazy learning and memorybased learning, and focuses on locally weighted linear regression. The survey discusses distance functions, smoothing parameters, weighting functions, local model structures, regularization of the estimates and bias, ass ..."
Abstract

Cited by 594 (53 self)
 Add to MetaCart
This paper surveys locally weighted learning, a form of lazy learning and memorybased learning, and focuses on locally weighted linear regression. The survey discusses distance functions, smoothing parameters, weighting functions, local model structures, regularization of the estimates and bias
Understanding Normal and Impaired Word Reading: Computational Principles in QuasiRegular Domains
 PSYCHOLOGICAL REVIEW
, 1996
"... We develop a connectionist approach to processing in quasiregular 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 583 (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 lowfrequency exception words, and yet are still able
Designing Learning
 In
, 2004
"... …Truth [is] being involved in an eternal conversation about things that matter, conducted with passion and discipline…truth is not in the conclusions so much as in the process of conversation itself…if you want to be in truth you must be in conversation. Parker Palmer ..."
Abstract

Cited by 555 (9 self)
 Add to MetaCart
…Truth [is] being involved in an eternal conversation about things that matter, conducted with passion and discipline…truth is not in the conclusions so much as in the process of conversation itself…if you want to be in truth you must be in conversation. Parker Palmer
Learning to rank using gradient descent
 In ICML
, 2005
"... We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these ideas using a neural network to model the underlying ranking function. We present test results on toy data and on data f ..."
Abstract

Cited by 510 (17 self)
 Add to MetaCart
We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these ideas using a neural network to model the underlying ranking function. We present test results on toy data and on data
A learning algorithm for Boltzmann machines
 Cognitive Science
, 1985
"... The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a probl ..."
Abstract

Cited by 586 (13 self)
 Add to MetaCart
problem in o very short time. One kind of computation for which massively porollel networks appear to be well suited is large constraint satisfaction searches, but to use the connections efficiently two conditions must be met: First, a search technique that is suitable for parallel networks must be found
A theory of timed automata
, 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract

Cited by 2651 (32 self)
 Add to MetaCart
Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis
Time Discounting and Time Preference: A Critical Review
 Journal of Economic Literature
, 2002
"... www.people.cornell.edu/pages/edo1/. ..."
Results 1  10
of
567,598