5785 search results - page 360 / 1157 » Approximability of Probability Distributions |
128
Voted
STOC
1996
ACM
15 years 9 months ago
1996
ACM
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
135
click to vote
SPAA
1992
ACM
15 years 9 months 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...
CORR
2008
Springer
15 years 5 months ago
2008
Springer
A lower bound on the minimum mean-squared error (MSE) in a Bayesian estimation problem is proposed in this paper. This bound utilizes a well-known connection to the deterministic e...
173
Voted
SPAA
1998
ACM
15 years 8 months ago
1998
ACM
In this paper we develop models for and analyze several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the numb...
143
click to vote
COLING
2008
15 years 6 months ago
2008
This paper addresses the fundamental problem of document classification, and we focus attention on classification problems where the classes are mutually exclusive. In the course ...