644 search results - page 70 / 129 » A topological characterization of weakness |
166
click to vote
IJNSEC
2008
15 years 6 months ago
2008
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...
152
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
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 ...
137
click to vote
SIAMDM
1998
15 years 6 months ago
1998
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...
171
click to vote
FLAIRS
2009
15 years 4 months ago
2009
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...
239
click to vote
APWEB
2011
Springer
15 years 1 months ago
2011
Springer
This paper proposes a paraconsistent and nonmonotonic extension of description logic by planting a nonmonotonic mechanism called minimal inconsistency in paradoxical description lo...