933 search results - page 55 / 187 » Monotone Complexity of a Pair |
BMCBI
2008
13 years 9 months ago
2008
Background: Structure-based computational methods are needed to help identify and characterize protein-protein complexes and their function. For individual proteins, the most succ...
TCS
2011
13 years 3 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
DCG
2010
13 years 6 months ago
2010
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...
AAAI
2010
13 years 10 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
BMCBI
2007
13 years 9 months ago
2007
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...