Sciweavers

5084 search results - page 890 / 1017
» Proving Possibility Properties
Sort
View
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
15 years 8 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
DBPL
1999
Springer
109views Database» more  DBPL 1999»
15 years 8 months ago
Expressing Topological Connectivity of Spatial Databases
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries...
Floris Geerts, Bart Kuijpers
ESEC
1999
Springer
15 years 8 months ago
FACADE: A Typed Intermediate Language Dedicated to Smart Cards
The use of smart cards to run software modules on demand has become a major business concern for application issuers. Such downloadable executable content requires to be trusted by...
Gilles Grimaud, Jean-Louis Lanet, Jean-Jacques Van...
RTAS
1999
IEEE
15 years 8 months ago
Timing Constraint Remapping to Avoid Time Discontinuities in Distributed Real-Time Systems
In this paper we propose a dynamic constraint transformation technique for ensuring timing requirements in a distributed real-time system possessing periodically synchronized dist...
Minsoo Ryu, Jungkeun Park, Seongsoo Hong
IH
1999
Springer
15 years 8 months ago
Hiding Signatures in Graph Coloring Solutions
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
Gang Qu, Miodrag Potkonjak