131 search results - page 5 / 27 » The Complexity of Online Memory Checking |
AINA
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper points out the privacy issue in the OCSP (Online Certificate Status Protocol), namely, the OCSP responder learns confidential information – who sends a message to w...
CRYPTO
2006
Springer
13 years 10 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
ENTCS
2007
13 years 7 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
ESANN
2007
13 years 8 months ago
2007
We apply kernel-based machine learning methods to online learning situations, and look at the related requirement of reducing the complexity of the learnt classifier. Online meth...
MOBIHOC
2009
ACM
13 years 11 months ago
2009
ACM
We address the problem of estimating the remaining energy of a node battery in wireless sensor networks. To solve this issue, we provide an on-line battery model that requires lim...