Sciweavers

44 search results - page 8 / 9
» On basing one-way functions on NP-hardness
Sort
View
ICFEM
1997
Springer
14 years 21 days ago
Formally Specifying and Verifying Real-Time Systems
A real-time computer system is a system that must perform its functions within specified time bounds. These systems are generally characterized by complex interactions with the en...
Richard A. Kemmerer
BMCBI
2007
107views more  BMCBI 2007»
13 years 8 months ago
Reuse of structural domain-domain interactions in protein networks
Background: Protein interactions are thought to be largely mediated by interactions between structural domains. Databases such as iPfam relate interactions in protein structures t...
Benjamin Schuster-Böckler, Alex Bateman
FSTTCS
1993
Springer
14 years 19 days ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell
DRM
2006
Springer
14 years 6 days ago
The problem with rights expression languages
In this paper we consider the functionality that a rights expression language (REL) should provide within a digital rights management (DRM) environment. We begin by noting the dea...
Pramod A. Jamkhedkar, Gregory L. Heileman, Iv&aacu...
ER
2007
Springer
157views Database» more  ER 2007»
14 years 2 months ago
Perceived vs. Measured Quality of Conceptual Schemas: An Experimental Comparison
Frequently the behaviour of an information system is functionally correct, but it does not meet some quality criteria, such as completeness, consistency, and usability. One way to...
Samira Si-Said Cherfi, Jacky Akoka, Isabelle Comyn...