11151 search results - page 249 / 2231 » On the Complexity of Model Expansion |
214
click to vote
BMCBI
2007
15 years 7 months ago
2007
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
183
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: With the rapid emergence of RNA databases and newly identified non-coding RNAs, an efficient compression algorithm for RNA sequence and structural information is neede...
209
click to vote
ECCC
2008
15 years 7 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
187
click to vote
PROMISE
2010
15 years 2 months ago
2010
Background. Currently there are several definitions of measures that should represent the size of software functional requirements. These measures have gained a quite relevant rol...
215
click to vote
AAAI
2006
15 years 8 months ago
2006
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...