Sciweavers

7988 search results - page 1526 / 1598
» A Useful Undecidable Theory
Sort
View
PODC
2006
ACM
15 years 10 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
PODC
2006
ACM
15 years 10 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
SAC
2006
ACM
15 years 10 months ago
Interval-based robust statistical techniques for non-negative convex functions, with application to timing analysis of computer
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
Michael Orshansky, Wei-Shen Wang, Martine Ceberio,...
SACMAT
2006
ACM
15 years 10 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
SACMAT
2006
ACM
15 years 10 months ago
Fine-grained role-based delegation in presence of the hybrid role hierarchy
Delegation of authority is an important process that needs to be captured by any access control model. In role-based access control models, delegation of authority involves delega...
James B. D. Joshi, Elisa Bertino
« Prev « First page 1526 / 1598 Last » Next »