2233 search results - page 126 / 447 » On the Complexity of Theory Curbing |
141
click to vote
COLING
1992
15 years 7 months ago
1992
This paper focuses on a theory of tense and aspect (the representation of time in natural language) that attempts a formM representation of the relevant liltguistic devices as imp...
167
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemm...
148
click to vote
SIGACT
2010
15 years 4 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
170
click to vote
TCS
2011
15 years 1 months ago
2011
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n + 2)-nomial with a constant term, allowing real exponents as well as real...
237
click to vote
SEMWEB
2010
Springer
2010
Springer
Theoretical foundations and engineering tools for building ontologies as reference conceptual models
15 years 1 months ago
Abstract. Perhaps the most fundamental notion underlying the desiderata for a successful Semantic Web is Semantic Interoperability. In this context, ontologies have been more and m...