5153 search results - page 258 / 1031 » Introduction to Randomized Algorithms |
123
Voted
WSC
2001
15 years 5 months ago
2001
In this paper we present an algorithm for simulating functions of the minimum and terminal value for a random walk with Gaussian increments. These expectations arise in connection...
119
click to vote
ALGORITHMICA
2010
15 years 3 months ago
2010
Abstract Given an n-point metric (P,d) and an integer k > 0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a r...
129
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
In this paper we introduce the class of Spread Codes for the use in random network coding. Spread Codes are based on the construction of spreads in finite projective geometry. The ...
167
Voted
ALGORITHMICA
2006
15 years 3 months ago
2006
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
102
click to vote
AAECC
2002
Springer
15 years 3 months ago
2002
Springer
A fruitful interaction between a new randomized WZ procedure and other computer algebra programs is illustrated by the computer proof of a series evaluation that originates from a ...