7106 search results - page 46 / 1422 » Restricted Complexity, General Complexity |
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...
ECAI
1994
Springer
15 years 2 months ago
1994
Springer
Abstract. Many recent works point out that there are several possibilities of assigning a meaning to a concept definition containing some sort of recursion. In this paper, we argue...
148
click to vote
DEON
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper, we present an adaptive logic for deontic conflicts, called P2.1r , that is based on Goble’s logic SDLaPe—a bimodal extension of Goble’s logic P that...
SAGA
2007
Springer
15 years 4 months ago
2007
Springer
We present two results for computational models that allow error probabilities close to 1/2. First, most computational complexity classes have an analogous class in communication ...
ACL
1994
14 years 11 months ago
1994
Finite-state transducers give efficient representations of many Natural Language phenomena. They allow to account for complex lexicon restrictions encountered, without involving t...