Sciweavers

3353 search results - page 628 / 671
» Laver and set theory
Sort
View
ANCS
2006
ACM
16 years 23 days ago
WormTerminator: an effective containment of unknown and polymorphic fast spreading worms
The fast spreading worm is becoming one of the most serious threats to today’s networked information systems. A fast spreading worm could infect hundreds of thousands of hosts w...
Songqing Chen, Xinyuan Wang, Lei Liu, Xinwen Zhang
MOBICOM
2006
ACM
16 years 22 days ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
PODC
2006
ACM
16 years 22 days 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
SACMAT
2006
ACM
16 years 22 days 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
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
16 years 22 days ago
Nobody's perfect: interactive synthesis from parametrized real-time scenarios
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
Holger Giese, Stefan Henkler, Martin Hirsch, Flori...