1806 search results - page 87 / 362 » Randomness and halting probabilities |
JC
2006
13 years 8 months ago
2006
We study the problem of multivariate integration over Rd with integrands of the form f(x)d(x) where d is a probability density function. Practical problems of this form occur comm...
SODA
2010
ACM
14 years 6 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...
RANDOM
1998
Springer
14 years 1 months ago
1998
Springer
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
SPAA
1992
ACM
14 years 28 days ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
COLT
2006
Springer
14 years 19 days ago
2006
Springer
Abstract. The regularization functional induced by the graph Laplacian of a random neighborhood graph based on the data is adaptive in two ways. First it adapts to an underlying ma...