154 search results - page 22 / 31 » rsa 2006 |
CCS
2006
ACM
15 years 3 months ago
2006
ACM
Much of today's distributed computing takes place in a client/server model. Despite advances in fault tolerance
102
click to vote
CHES
2006
Springer
15 years 3 months ago
2006
Springer
It is well known that a malicious adversary can try to retrieve secret information by inducing a fault during cryptographic operations. Following the work of Seifert on fault induc...
101
click to vote
RSA
2002
14 years 11 months ago
2002
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
95
Voted
RSA
2002
14 years 11 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
RSA
2002
14 years 11 months ago
2002
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...