Sciweavers

644 search results - page 70 / 129
» A topological characterization of weakness
Sort
View
IJNSEC
2008
103views more  IJNSEC 2008»
14 years 12 months ago
On Cipher Design Based on Switchable Controlled Operations
This paper concerns the problem of reducing the implementation cost of the switchable data-dependent operations (SDDOs) that are a new cryptographic primitive oriented to the desi...
Nikolay A. Moldovyan
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
16 years 5 days ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
SIAMDM
1998
95views more  SIAMDM 1998»
14 years 11 months ago
The Graphs with All Subgraphs T-Perfect
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
A. M. H. Gerards, F. Bruce Shepherd
FLAIRS
2009
14 years 9 months ago
Modeling Belief Change on Epistemic States
Belief revision always results in trusting new evidence, so it may admit an unreliable one and discard a more confident one. We therefore use belief change instead of belief revis...
Jianbing Ma, Weiru Liu
APWEB
2011
Springer
14 years 7 months ago
A Tableau Algorithm for Paraconsistent and Nonmonotonic Reasoning in Description Logic-Based System
This paper proposes a paraconsistent and nonmonotonic extension of description logic by planting a nonmonotonic mechanism called minimal inconsistency in paradoxical description lo...
Xiaowang Zhang, Zuoquan Lin, Kewen Wang