6251 search results - page 831 / 1251 » Randomness, Computability, and Density |
231
click to vote
PCI
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. It has been recently demonstrated that the classical EM algorithm for learning Gaussian mixture models can be successfully implemented in a decentralized manner by resort...
208
Voted
PPAM
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
155
Voted
UC
2005
Springer
16 years 1 months ago
2005
Springer
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...
216
Voted
COMPGEOM
2004
ACM
16 years 1 months ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
187
Voted
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
This paper describes an e cient method for learning the parameters of a Gaussian process (GP). The parameters are learned from multiple tasks which are assumed to have been drawn ...