5115 search results - page 72 / 1023 » On Randomized Lanczos Algorithms |
APPROX
2007
Springer
15 years 6 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...
132
click to vote
MMB
2010
Springer
15 years 1 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...
SWAT
1994
Springer
15 years 3 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...
104
click to vote
SACRYPT
2004
Springer
15 years 5 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...
SODA
2010
ACM
15 years 9 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...