Results 1  10
of
9,566
Regularization Theory and Neural Networks Architectures
 Neural Computation
, 1995
"... We had previously shown that regularization principles lead to approximation schemes which are equivalent to networks with one layer of hidden units, called Regularization Networks. In particular, standard smoothness functionals lead to a subclass of regularization networks, the well known Radial Ba ..."
Abstract

Cited by 395 (32 self)
 Add to MetaCart
We had previously shown that regularization principles lead to approximation schemes which are equivalent to networks with one layer of hidden units, called Regularization Networks. In particular, standard smoothness functionals lead to a subclass of regularization networks, the well known Radial
Fuzzy Rules And Regularization Theory
"... : Regularization theory and stochastic processes have the advantage that apriori information is expressed directly in terms of the function values of interest. Classical regularization functionals are convex and possess a unique minimum. On the other hand, convex functionals can only implement AND ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
: Regularization theory and stochastic processes have the advantage that apriori information is expressed directly in terms of the function values of interest. Classical regularization functionals are convex and possess a unique minimum. On the other hand, convex functionals can only implement
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
Nonideal Sampling and Regularization Theory
, 2008
"... Shannon’s sampling theory and its variants provide effective solutions to the problem of reconstructing a signal from its samples in some “shiftinvariant” space, which may or may not be bandlimited. In this paper, we present some further justification for this type of representation, while addressi ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
Shannon’s sampling theory and its variants provide effective solutions to the problem of reconstructing a signal from its samples in some “shiftinvariant” space, which may or may not be bandlimited. In this paper, we present some further justification for this type of representation, while
Regularity theories reassessed
 Philosophia
, 2008
"... For a long time, regularity accounts of causation have virtually vanished from the scene. Problems encountered within other theoretical frameworks have recently induced authors working on causation, laws of nature, or methodologies of causal reasoning – as e.g. ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
For a long time, regularity accounts of causation have virtually vanished from the scene. Problems encountered within other theoretical frameworks have recently induced authors working on causation, laws of nature, or methodologies of causal reasoning – as e.g.
Recognitionbycomponents: A theory of human image understanding
 Psychological Review
, 1987
"... The perceptual recognition of objects is conceptualized to be a process in which the image of the input is segmented at regions of deep concavity into an arrangement of simple geometric components, such as blocks, cylinders, wedges, and cones. The fundamental assumption of the proposed theory, recog ..."
Abstract

Cited by 1272 (23 self)
 Add to MetaCart
The perceptual recognition of objects is conceptualized to be a process in which the image of the input is segmented at regions of deep concavity into an arrangement of simple geometric components, such as blocks, cylinders, wedges, and cones. The fundamental assumption of the proposed theory
Positive Deduction modulo Regular Theories
 in Proc. CSL '95, LNCS 1092
, 1995
"... . We propose a new technique for dealing with an equational theory E in the clausal framework. This consists of the definition of two inference rules called contextual superposition and extended superposition, and of an algorithm for computing the only needed applications of these last inference ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
inference rules only by examining the axioms of E. We prove the refutational completeness of this technique for a class of theories E that include all the regular theories, i.e. any theory whose axioms preserve variables. This generalizes the results of Wertz [31] and Paul [17] who could not prove
Results 1  10
of
9,566