Sciweavers

75 search results - page 3 / 15
» Definability of Combinatorial Functions and Their Linear Rec...
Sort
View
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 7 months ago
Counting Claw-Free Cubic Graphs
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are used to derive a second order, linear homogeneous differential equation with polyno...
Edgar M. Palmer, Ronald C. Read, Robert W. Robinso...
ANNS
2010
13 years 2 months ago
Search Space Restriction of Neuro-evolution through Constrained Modularization of Neural Networks
Evolving recurrent neural networks for behavior control of robots equipped with larger sets of sensors and actuators is difficult due to the large search spaces that come with the ...
Christian W. Rempis, Frank Pasemann
BMCBI
2004
146views more  BMCBI 2004»
13 years 7 months ago
Defining transcriptional networks through integrative modeling of mRNA expression and transcription factor binding data
Background: Functional genomics studies are yielding information about regulatory processes in the cell at an unprecedented scale. In the yeast S. cerevisiae, DNA microarrays have...
Feng Gao, Barrett C. Foat, Harmen J. Bussemaker
TCBB
2008
76views more  TCBB 2008»
13 years 7 months ago
Hadamard Conjugation for the Kimura 3ST Model: Combinatorial Proof Using Path Sets
Under a stochastic model of molecular sequence evolution the probability of each possible pattern of characters is well defined. The Kimura's three-substitution-types (K3ST) m...
Michael D. Hendy, Sagi Snir
CCCG
2010
13 years 9 months ago
Combinatorial changes of euclidean minimum spanning tree of moving points in the plane
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...
Zahed Rahmati, Alireza Zarei