4007 search results - page 234 / 802 » Computation with imprecise probabilities |
162
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
DAGSTUHL
2006
15 years 5 months ago
2006
The problem of prediction future event given an individual sequence of past events is considered. Predictions are given in form of real numbers pn which are computed by some algori...
135
click to vote
ESANN
2003
15 years 5 months ago
2003
Efficient probability density function estimation is of primary interest in statistics. A popular approach for achieving this is the use of finite Gaussian mixture models. Based on...
118
click to vote
UAI
2004
15 years 5 months ago
2004
Within the task of collaborative filtering two challenges for computing conditional probabilities exist. First, the amount of training data available is typically sparse with resp...
143
click to vote
IJCAI
1993
15 years 5 months ago
1993
In this paper we present an average-case analysis of the nearest neighbor algorithm, a simple induction method that has been studied by manyresearchers. Our analysis assumes a con...