1806 search results - page 223 / 362 » Randomness and halting probabilities |
102
click to vote
NIPS
2008
15 years 5 months ago
2008
We consider multi-armed bandit problems where the number of arms is larger than the possible number of experiments. We make a stochastic assumption on the mean-reward of a new sel...
128
click to vote
NIPS
2007
15 years 5 months ago
2007
Rare category detection is an open challenge for active learning, especially in the de-novo case (no labeled examples), but of significant practical importance for data mining - ...
133
click to vote
ACL
2006
15 years 5 months ago
2006
We investigate generalizations of the allsubtrees "DOP" approach to unsupervised parsing. Unsupervised DOP models assign all possible binary trees to a set of sentences ...
143
click to vote
UAI
2003
15 years 5 months ago
2003
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
121
click to vote
ESM
2000
15 years 5 months ago
2000
The framework of this paper is the design of complex communication protocols by simulation, based on formal description techniques (FDT). We propose a general-purpose scalable mod...