1286 search results - page 226 / 258 » A Practical Modelling Notation for Secure Distributed Comput... |
SAC
2010
ACM
14 years 2 months ago
2010
ACM
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
EAGC
2003
Springer
14 years 24 days ago
2003
Springer
Application layer networks are software architectures that allow the provisioning of services requiring a huge amount of resources by connecting large numbers of individual compute...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
We consider video sequences that have been encrypted uncompressed. Since encryption masks the source, traditional data compression algorithms are rendered ineffective. However, it...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...