5115 search results - page 72 / 1023 » On Randomized Lanczos Algorithms |
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
We consider the problem of derandomizing random walks in the Euclidean space Rk . We show that for k = 2, and in some cases in higher dimensions, such walks can be simulated in Lo...
154
click to vote
MMB
2010
Springer
15 years 4 months ago
2010
Springer
Phase-type (PH) distributions are proven to be very powerful tools in modelling and analysis of a wide range of phenomena in computer systems. The use of these distributions in sim...
130
click to vote
SWAT
1994
Springer
15 years 6 months ago
1994
Springer
We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitiv...
129
click to vote
SACRYPT
2004
Springer
15 years 7 months ago
2004
Springer
A general method to secure cryptographic algorithm implementations against side-channel attacks is the use of randomization techniques and, in particular, masking. Roughly speaking...
114
click to vote
SODA
2010
ACM
15 years 12 months ago
2010
ACM
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(lo...