835 search results - page 30 / 167 » Characterizing rosy theories |
109
click to vote
JAIR
2008
15 years 1 months ago
2008
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In order to formalize these tasks as reasoning problems, we introduce the notions o...
133
Voted
CN
2004
15 years 1 months ago
2004
Wireless Sensor Networks (WSN) are characterized by the dense deployment of sensor nodes that continuously observe physical phenomenon. Due to high density in the network topology...
100
Voted
TIT
2002
15 years 1 months ago
2002
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
122
click to vote
CORR
2002
Springer
15 years 1 months ago
2002
Springer
Groenendijk and Stokhof (1984, 1996; Groenendijk 1999) provide a logically attractive theory of the semantics of natural language questions, commonly referred to as the partition t...
114
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...