Sciweavers

9810 search results - page 1867 / 1962
» Problems, Descriptions and Objects
Sort
View
PODC
2010
ACM
15 years 2 months ago
Deterministic distributed vertex coloring in polylogarithmic time
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
AAIM
2006
Springer
129views Algorithms» more  AAIM 2006»
15 years 1 months ago
Secure Overlay Network Design
Due to the increasing security threats on the Internet, new overlay network architectures have been proposed to secure privileged services. In these architectures, the application...
Erran L. Li, Mohammad Mahdian, Vahab S. Mirrokni
CCS
2006
ACM
15 years 1 months ago
Safety analysis of usage control authorization models
The usage control (UCON) model was introduced as a unified approach to capture a number of extensions for traditional access control models. While the policy specification flexibi...
Xinwen Zhang, Ravi S. Sandhu, Francesco Parisi-Pre...
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
15 years 1 months ago
Scheduling with Bully Selfish Jobs
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
Tami Tamir
FAST
2008
15 years 12 days ago
SWEEPER: An Efficient Disaster Recovery Point Identification Mechanism
Data corruption is one of the key problems that is on top of the radar screen of most CIOs. Continuous Data Protection (CDP) technologies help enterprises deal with data corruptio...
Akshat Verma, Kaladhar Voruganti, Ramani Routray, ...
« Prev « First page 1867 / 1962 Last » Next »