Sciweavers

1396 search results - page 25 / 280
» aim 2006
Sort
View
IGPL
1998
115views more  IGPL 1998»
14 years 9 months ago
Bridging de Bruijn Indices and Variable Names in Explicit Substitutions Calculi
Calculi of explicit substitutions have almost always been presented using de Bruijn indices with the aim of avoiding -conversion and being as close to machines as possible. De Bru...
Fairouz Kamareddine, Alejandro Ríos
RSA
1998
53views more  RSA 1998»
14 years 9 months ago
Recursive reconstruction on periodic trees
A periodic tree Tn consists of full n-level copies of a finite tree T. The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjace...
Elchanan Mossel
IJON
2006
111views more  IJON 2006»
14 years 9 months ago
Dynamic pruning algorithm for multilayer perceptron based neural control systems
Generalization ability of neural networks is very important and a rule of thumb for good generalization in neural systems is that the smallest system should be used to fit the tra...
Jie Ni, Qing Song
IJON
2002
71views more  IJON 2002»
14 years 9 months ago
Generation of the respiratory rhythm: state-dependency and switching
Two alternative concepts have been o ered to explain the neural mechanisms responsible for the generation of the respiratory motor pattern in the brainstem: a network paradigm and...
Ilya A. Rybak, Julian F. R. Paton, R. F. Rogers, W...
DGCI
2006
Springer
15 years 1 months ago
Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification
The aim of this article is to present a reversible and topologically correct construction of a polyhedron from a binary object. The proposed algorithm is based on a Marching Cubes...
David Coeurjolly, Florent Dupont, Laurent Jospin, ...