Sciweavers

5153 search results - page 78 / 1031
» Introduction to Randomized Algorithms
Sort
View
KDD
2003
ACM
127views Data Mining» more  KDD 2003»
15 years 10 months ago
Experiments with random projections for machine learning
Dimensionality reduction via Random Projections has attracted considerable attention in recent years. The approach has interesting theoretical underpinnings and offers computation...
Dmitriy Fradkin, David Madigan
IPPS
2000
IEEE
15 years 2 months ago
Transient Analysis of Dependability/Performability Models by Regenerative Randomization with Laplace Transform Inversion
In this paper we develop a variant of a previously proposed method the regenerative randomization method for the transient analysis of dependability performability models. The va...
Juan A. Carrasco
APPROX
2007
Springer
88views Algorithms» more  APPROX 2007»
15 years 4 months ago
Derandomization of Euclidean Random Walks
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...
Ilia Binder, Mark Braverman
MMB
2010
Springer
185views Communications» more  MMB 2010»
14 years 11 months ago
Reducing the Cost of Generating APH-Distributed Random Numbers
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...
Philipp Reinecke, Miklós Telek, Katinka Wol...
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
15 years 1 months ago
New On-Line Algorithms for the Page Replication Problem
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...
Susanne Albers, Hisashi Koga