333 search results - page 51 / 67 » Optimal sampling from distributed streams |
UAI
2004
13 years 10 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
TNN
2010
13 years 3 months ago
2010
We consider the problem of semi-supervised feature selection, where we are given a small amount of labeled examples and a large amount of unlabeled examples. Since a small number ...
SODA
2000
ACM
13 years 10 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
CORR
2000
Springer
13 years 8 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
NECO
2011
13 years 3 months ago
2011
Selection of an optimal estimator typically relies on either supervised training samples (pairs of measurements and their associated true values), or a prior probability model for...