Sciweavers

269 search results - page 5 / 54
» random 2001
Sort
View
UAI
2003
13 years 11 months ago
Markov Random Walk Representations with Continuous Distributions
We propose a framework to extend Markov random walks (Szummer and Jaakkola, 2001) to a continuum of points. In this framework, the transition probability between two points is the...
Chen-Hsiang Yeang, Martin Szummer
WSC
2001
13 years 11 months ago
Resampling methods for input modeling
Stochastic simulation models are used to predict the behavior of real systems whose components have random variation. The simulation model generates artificial random quantities b...
Russell R. Barton, Lee Schruben
NIPS
2001
13 years 11 months ago
Sampling Techniques for Kernel Methods
We propose randomized techniques for speeding up Kernel Principal Component Analysis on three levels: sampling and quantization of the Gram matrix in training, randomized rounding...
Dimitris Achlioptas, Frank McSherry, Bernhard Sch&...
WSC
2001
13 years 11 months ago
Software for uniform random number generation: distinguishing the good and the bad
The requirements, design principles, and statistical testing approaches of uniform random number generators for simulation are briefly surveyed. An objectoriented random number pa...
Pierre L'Ecuyer
SODA
2001
ACM
138views Algorithms» more  SODA 2001»
13 years 11 months ago
The diameter of random massive graphs
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...
Linyuan Lu