Sciweavers

3122 search results - page 258 / 625
» A Theory of Network Equivalence
Sort
View
ESORICS
2004
Springer
15 years 10 months ago
Information Flow Control Revisited: Noninfluence = Noninterference + Nonleakage
Abstract. We revisit the classical notion of noninterference for statebased systems, as presented by Rushby in 1992. We strengthen his results in several ways, in particular clarif...
David von Oheimb
RSCTC
2000
Springer
227views Fuzzy Logic» more  RSCTC 2000»
15 years 10 months ago
Rough Sets in Approximate Spatial Reasoning
Abstract. In spatial reasoning the qualitative description of relations between spatial regions is of practical importance and has been widely studied. Examples of such relations a...
Thomas Bittner, John G. Stell
COMPGEOM
1995
ACM
15 years 10 months ago
How Good are Convex Hull Algorithms?
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
David Avis, David Bremner
STOC
1995
ACM
107views Algorithms» more  STOC 1995»
15 years 10 months ago
Incremental cryptography and application to virus protection
The goal of incremental cryptography is to design cryptographic algorithms with the property that having applied the algorithm to a document, it is possible to quickly update the ...
Mihir Bellare, Oded Goldreich, Shafi Goldwasser
NIL
1991
15 years 10 months ago
Deduction with Supernormal Defaults
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential ent...
Stefan Brass