Sciweavers

31 search results - page 1 / 7
» Formalizing work: reallocating redundancy
Sort
View
CSCW
2006
ACM
13 years 10 months ago
Formalizing work: reallocating redundancy
Glenn Munkvold, Gunnar Ellingsen, Hege Koksvik
NGC
1998
Springer
115views Communications» more  NGC 1998»
13 years 4 months ago
On Semantic Resolution with Lemmaizing and Contraction and a Formal Treatment of Caching
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
Maria Paola Bonacina, Jieh Hsiang
AICCSA
2006
IEEE
137views Hardware» more  AICCSA 2006»
13 years 10 months ago
Modeling Redundancy: Quantitative and Qualitative Models
Redundancy is a system property that generally refers to duplication of state information or system function. While redundancy is usually investigated in the context of fault tole...
Ali Mili, Lan Wu, Frederick T. Sheldon, Mark Shere...
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
13 years 9 months ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
Daniel R. L. Brown, Donald Byron Johnson
CLA
2006
13 years 6 months ago
An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy
Formal Concept Analysis (FCA) considers attributes as a non-ordered set. This is appropriate when the data set is not structured. When an attribute taxonomy exists, existing techni...
Peggy Cellier, Sébastien Ferré, Oliv...