Results 1  10
of
14,636
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 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 lowfrequency exception words, and yet are still able
The Class of Structurally Regular Semigroups
, 2005
"... A semigroup S is said to be structurally regular if there exists an ordered pair (n; m) of nonnegative integers such that the quotient S=(n; m) is regular in the usual sense. The congruence (n; m) may be dened in the following manner: (n; m) = f(a; b) : uav = ubv; 8u 2 Sn; v 2 Smg; where Sk for k ..."
Abstract
 Add to MetaCart
A semigroup S is said to be structurally regular if there exists an ordered pair (n; m) of nonnegative integers such that the quotient S=(n; m) is regular in the usual sense. The congruence (n; m) may be dened in the following manner: (n; m) = f(a; b) : uav = ubv; 8u 2 Sn; v 2 Smg; where Sk for k
Convolution Kernels on Discrete Structures
, 1999
"... We introduce a new method of constructing kernels on sets whose elements are discrete structures like strings, trees and graphs. The method can be applied iteratively to build a kernel on an infinite set from kernels involving generators of the set. The family of kernels generated generalizes the fa ..."
Abstract

Cited by 506 (0 self)
 Add to MetaCart
We introduce a new method of constructing kernels on sets whose elements are discrete structures like strings, trees and graphs. The method can be applied iteratively to build a kernel on an infinite set from kernels involving generators of the set. The family of kernels generated generalizes
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 599 (51 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
The SWISSMODEL Workspace: A webbased environment for protein structure homology modelling
 BIOINFORMATICS
, 2005
"... Motivation: Homology models of proteins are of great interest for planning and analyzing biological experiments when no experimental threedimensional structures are available. Building homology models requires specialized programs and uptodate sequence and structural databases. Integrating all re ..."
Abstract

Cited by 575 (5 self)
 Add to MetaCart
databases necessary for modelling are accessible from the workspace and are updated in regular intervals. Tools for template selection, model building, and structure quality evaluation can be invoked from within the workspace. Workflow and usage of the workspace are illustrated by modelling human Cyclin A1
Algebraic Graph Theory
, 2011
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract

Cited by 892 (13 self)
 Add to MetaCart
regular fashion. These arise regularly in connection with extremal structures: such structures often have an unexpected degree of regularity and, because of this, often give rise to an association scheme. This in turn leads to a semisimple commutative algebra and the representation theory of this algebra
A review of image denoising algorithms, with a new one
 SIMUL
, 2005
"... The search for efficient image denoising methods is still a valid challenge at the crossing of functional analysis and statistics. In spite of the sophistication of the recently proposed methods, most algorithms have not yet attained a desirable level of applicability. All show an outstanding perf ..."
Abstract

Cited by 508 (6 self)
 Add to MetaCart
performance when the image model corresponds to the algorithm assumptions but fail in general and create artifacts or remove image fine structures. The main focus of this paper is, first, to define a general mathematical and experimental methodology to compare and classify classical image denoising algorithms
Metabolic stability and epigenesis in randomly connected nets
 Journal of Theoretical Biology
, 1969
"... “The world is either the effect of cause or chance. If the latter, it is a world for all that, that is to say, it is a regular and beautiful structure.” Marcus Aurelius Protoorganisms probably were randomly aggregated nets of chemical reactions. The hypothesis that contemporary organisms are also r ..."
Abstract

Cited by 657 (5 self)
 Add to MetaCart
“The world is either the effect of cause or chance. If the latter, it is a world for all that, that is to say, it is a regular and beautiful structure.” Marcus Aurelius Protoorganisms probably were randomly aggregated nets of chemical reactions. The hypothesis that contemporary organisms are also
Extracting Relations from Large PlainText Collections
, 2000
"... Text documents often contain valuable structured data that is hidden in regular English sentences. This data is best exploited if available as a relational table that we could use for answering precise queries or for running data mining tasks. We explore a technique for extracting such tables fr ..."
Abstract

Cited by 494 (25 self)
 Add to MetaCart
Text documents often contain valuable structured data that is hidden in regular English sentences. This data is best exploited if available as a relational table that we could use for answering precise queries or for running data mining tasks. We explore a technique for extracting such tables
Mining Source Code for Structural Regularities
, 2010
"... During software development, design rules and contracts in the source code are often encoded through regularities, such as API usage protocols, coding idioms and naming conventions. The structural regularities that govern a program can aid in comprehension and maintenance of the application, but ar ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
During software development, design rules and contracts in the source code are often encoded through regularities, such as API usage protocols, coding idioms and naming conventions. The structural regularities that govern a program can aid in comprehension and maintenance of the application
Results 1  10
of
14,636