11862 search results - page 9 / 2373 » Relative information completeness |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Given a graph G = (V, E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V × V ) \ E such that the graph...
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
In data publishing, the owner delegates the role of satisfying user queries to a third-party publisher. As the publisher may be untrusted or susceptible to attacks, it could produ...
STACS
2001
Springer
13 years 12 months ago
2001
Springer
It is well known that finite square matrices over a Kleene algebra again form a Kleene algebra. This is also true for infinite matrices under suitable restrictions. One can use t...
CC
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We discuss the challenges faced by bytecode analyzers designed for code verification compared to similar analyzers for source code. While a bytecode-level analysis brings...