Sciweavers

2145 search results - page 389 / 429
» Lax Logical Relations
Sort
View
ENTCS
2002
77views more  ENTCS 2002»
13 years 7 months ago
Trivial Reals
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...
CORR
1998
Springer
103views Education» more  CORR 1998»
13 years 7 months ago
The descriptive complexity approach to LOGCFL
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclass...
Clemens Lautemann, Pierre McKenzie, Thomas Schwent...
CN
1999
143views more  CN 1999»
13 years 7 months ago
Embedding Knowledge in Web Documents
The paper argues for the use of general and intuitive knowledge representation languages (and simpler notational variants, e.g. subsets of natural languages) for indexing the cont...
Philippe Martin, Peter W. Eklund
IPL
1998
89views more  IPL 1998»
13 years 7 months ago
A Limitation of Vector Timestamps for Reconstructing Distributed Computations
Vector timestamps provide a way of recording the causal relationships between events in a distributed computation. We draw attention to a limitation of such timestamps when used t...
Colin J. Fidge
LRE
2002
84views more  LRE 2002»
13 years 7 months ago
Text-image Coupling for Editing Literary Sources
Users need more sophisticated tools to handle the growing number of image-based documents available in databases. In this paper, we present a system devoted to the editing and bro...
Eric Lecolinet, Laurent Robert, François Ro...