1220 search results - page 54 / 244 » Restricting grammatical complexity |
AAAI
2006
13 years 9 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 ...
ICS
2010
Tsinghua U.
14 years 5 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
MFCS
2009
Springer
14 years 7 days ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
BMCBI
2005
13 years 7 months ago
2005
Background: The 'lid' subcomplex of the 26S proteasome and the COP9 signalosome (CSN complex) share a common architecture consisting of six subunits harbouring a so-call...