Sciweavers

4488 search results - page 782 / 898
» Properties of NP-Complete Sets
Sort
View
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
14 years 14 days ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali
RTSS
1999
IEEE
14 years 12 days ago
Design and Implementation of Statistical Rate Monotonic Scheduling in KURT Linux
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and...
Alia Atlas, Azer Bestavros
AGP
1998
IEEE
14 years 12 days ago
Dynamic Logic Programming
In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow de...
José Júlio Alferes, João Alex...
IH
1999
Springer
14 years 12 days 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
SIGGRAPH
1998
ACM
14 years 11 days ago
Non-distorted Texture Mapping for Sheared Triangulated Meshes
This article introduces new techniques for non-distorted texture mapping on complex triangulated meshes. Texture coordinates are assigned to the vertices of the triangulation by u...
Bruno Lévy, Jean-Laurent Mallet