18090 search results - page 138 / 3618 » Computing by Only Observing |
170
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
142
click to vote
JSC
2006
15 years 6 months ago
2006
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if...
149
click to vote
ADT
2005
15 years 6 months ago
2005
For coded transmission over a memoryless channel, two kinds of mutual information are considered: the mutual information between a code symbol and its noisy observation and the ove...
158
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
139
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— This paper introduces a Bayesian filter that is specifically designed for counting targets that move outside of the field of view while performing a sensor sweep. Informatio...