Sciweavers

3443 search results - page 102 / 689
» More Algebras for Determiners
Sort
View
CDB
2004
Springer
169views Database» more  CDB 2004»
14 years 1 months ago
Semantic Optimization of Preference Queries
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). We present here a nu...
Jan Chomicki
SWAT
2004
Springer
108views Algorithms» more  SWAT 2004»
14 years 1 months ago
Pointed Binary Encompassing Trees
For n disjoint line segments in the plane we can construct a binary encompassing tree such that every vertex is pointed, what’s more, at every segment endpoint all incident edges...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...
FC
1999
Springer
97views Cryptology» more  FC 1999»
14 years 14 days ago
Playing "Hide and Seek" with Stored Keys
In this paper we consider the problem of efficiently locating cryptographic keys hidden in gigabytes of data, such as the complete file system of a typical PC. We describe efficie...
Adi Shamir, Nicko van Someren
ESOP
1992
Springer
14 years 8 days ago
A Provably Correct Compiler Generator
We have designed, implemented, and proved the correctness of a compiler generator that accepts action semantic descriptions of imperative programming languages. The generated comp...
Jens Palsberg
APSEC
2003
IEEE
13 years 12 months ago
Modular refinement in novel schema calculi
Using the language Z for more than specification is hindered by the fact that its algebra of schemas is not monotonic with respect to refinement; so specification is modular, but ...
Moshe Deutsch, Martin C. Henson, Besnik Kajtazi