Sciweavers

3154 search results - page 246 / 631
» Computing Closed Skycubes
Sort
View
JLP
2000
140views more  JLP 2000»
15 years 6 months ago
An abductive event calculus planner
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
Murray Shanahan
IJON
2002
98views more  IJON 2002»
15 years 6 months ago
Blind deconvolution by simple adaptive activation function neuron
The `Bussgang' algorithm is one among the most known blind deconvolution techniques in the adaptive signal processing literature. It relies on a Bayesian estimator of the sou...
Simone Fiori
ECCC
1998
117views more  ECCC 1998»
15 years 6 months ago
Determinant: Old Algorithms, New Insights
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
Meena Mahajan, V. Vinay
FMSD
1998
60views more  FMSD 1998»
15 years 6 months ago
The General Product Machine: a New Model for Symbolic FSM Traversal
Proving the equivalenceof two Finite State Machines (FSMs) has many applications to synthesis, veri cation, testing, and diagnosis. Building their product machine is a theoretical ...
Gianpiero Cabodi, Paolo Camurati, Fulvio Corno, Pa...
NN
2002
Springer
224views Neural Networks» more  NN 2002»
15 years 6 months ago
Optimal design of regularization term and regularization parameter by subspace information criterion
The problem of designing the regularization term and regularization parameter for linear regression models is discussed. Previously, we derived an approximation to the generalizat...
Masashi Sugiyama, Hidemitsu Ogawa