104 search results - page 1 / 21 » Computational Bounds on Hierarchical Data Processing with Ap... |
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
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...
IACR
2011
12 years 4 months ago
2011
Although malleability is undesirable in traditional digital signatures, schemes with limited malleability properties enable interesting functionalities that may be impossible to o...
DAGSTUHL
2008
13 years 6 months ago
2008
Techniques of reliable computing, like interval arithmetic, can be used to guarantee reliable solutions even in the presence of numerical round-off errors. The need to trace bounds...
CCS
2010
ACM
13 years 8 months ago
2010
ACM
Cloud computing has emerged as a multi-tenant resource sharing platform, which allows different service providers to deliver software as services in an economical way. However, fo...
CCGRID
2009
IEEE
13 years 11 months ago
2009
IEEE
Highly distributed systems such as Grids are used today to the execution of large-scale parallel applications. The behavior analysis of these applications is not trivial. The comp...