Sciweavers

2365 search results - page 215 / 473
» All things are connected
Sort
View
COMBINATORICS
2000
92views more  COMBINATORICS 2000»
15 years 6 months ago
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
Jason P. Bell, Edward A. Bender, Peter J. Cameron,...
COLING
2002
15 years 6 months ago
Text Authoring, Knowledge Acquisition and Description Logics
We present a principled approach to the problem of connecting a controlled document authoring system with a knowledge base. We start by describingclosed-world authoring situations...
Marc Dymetman
COMBINATORICS
2002
71views more  COMBINATORICS 2002»
15 years 6 months ago
Permutations Which Avoid 1243 and 2143, Continued Fractions, and Chebyshev Polynomials
Several authors have examined connections between permutations which avoid 132, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues...
Eric S. Egge, Toufik Mansour
IJON
2000
71views more  IJON 2000»
15 years 6 months ago
Variable selection using neural-network models
In this paper we propose an approach to variable selection that uses a neural-network model as the tool to determine which variables are to be discarded. The method performs a bac...
Giovanna Castellano, Anna Maria Fanelli
IJON
2000
86views more  IJON 2000»
15 years 6 months ago
Gain modulation of recurrent networks
Gain modulation is an important mechanism by which attentional and other inputs modify the amplitude of neuronal responses without changing their selectivity. Gain modulation has ...
Jian Zhang 0004, L. F. Abbott