2218 search results - page 132 / 444 » Testing Expressibility Is Hard |
PSB
2004
13 years 10 months ago
2004
Gene expression of a cell is controlled by sophisticated cellular processes. The capability of inferring the states of these cellular processes would provide insight into the mech...
ALIFE
2008
13 years 8 months ago
2008
The development of structure-learning algorithms for gene regulatory networks depends heavily on the availability of synthetic data sets that contain both the original network and ...
ISNN
2007
Springer
14 years 3 months ago
2007
Springer
Manifold learning algorithms have been proven to be capable of discovering some nonlinear structures. However, it is hard for them to extend to test set directly. In this paper, a ...
ACRI
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Cellular Automata are a powerful formal model for describing physical and computational processes. Qualitative analysis of Cellular Automata is in general a hard problem....
FOCS
1990
IEEE
14 years 1 months ago
1990
IEEE
We show a sharp dichotomy between systems of identical automata with a symmetric global control whose behavior is easy to predict, and those whose behavior is hard to predict. The...