Sciweavers

11580 search results - page 18 / 2316
» Communication vs. Computation
Sort
View
SACMAT
2006
ACM
14 years 1 months ago
The secondary and approximate authorization model and its application to Bell-LaPadula policies
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
Jason Crampton, Wing Leung, Konstantin Beznosov
CHI
2004
ACM
14 years 8 months ago
One-hundred days in an activity-centric collaboration environment based on shared objects
This paper describes a new collaboration technology that is carefully poised between informal, ad hoc, easy-to-initiate collaborative tools, vs. more formal, structured, and higho...
Michael J. Muller, Werner Geyer, Beth Brownholtz, ...
COCO
2000
Springer
161views Algorithms» more  COCO 2000»
14 years 9 hour ago
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
Ronald de Wolf
IFIP
2005
Springer
14 years 1 months ago
Type-Based Distributed Access Control vs. Untyped Attackers
This paper considers the effect of untyped attackers inside a distributed system where security is enforced by the type system. In previous work we introduced the Key-Based Decentr...
Tom Chothia, Dominic Duggan
INFOCOM
2011
IEEE
12 years 11 months ago
Sampling vs sketching: An information theoretic comparison
—The main approaches to high speed measurement in routers are traffic sampling, and sketching. However, it is not known which paradigm is inherently better at extracting informa...
Paul Tune, Darryl Veitch