Sciweavers

1923 search results - page 21 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ICALP
2005
Springer
14 years 2 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
SIGSOFT
2007
ACM
14 years 9 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
CCS
2006
ACM
14 years 6 days ago
Improving secure server performance by re-balancing SSL/TLS handshakes
Much of today's distributed computing takes place in a client/server model. Despite advances in fault tolerance
Claude Castelluccia, Einar Mykletun, Gene Tsudik
IEEEARES
2010
IEEE
14 years 3 months ago
A Complexity Based Model for Quantifying Forensic Evidential Probabilities
- An operational complexity model (OCM) is proposed to enable the complexity of both the cognitive and the computational components of a process to be determined. From the complexi...
Richard E. Overill, Jantje A. M. Silomon, Kam-Pui ...
EUROPAR
2007
Springer
13 years 10 months ago
Evaluation of a Utility Computing Model Based on the Federation of Grid Infrastructures
Utility computing is a service provisioning model which will provide adaptive, flexible and simple access to computing resources, enabling a pay-per-use model for computing simila...
Constantino Vázquez, Eduardo Huedo, Rub&eac...