63 search results - page 6 / 13 » Deterministic algorithms for sampling count data |
ECML
2007
Springer
14 years 1 months ago
2007
Springer
Boosting methods are known to exhibit noticeable overfitting on some datasets, while being immune to overfitting on other ones. In this paper we show that standard boosting algorit...
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
We show that it is possible to use data compression on independently obtained hypotheses from various tasks to algorithmically provide guarantees that the tasks are sufficiently r...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...
SIGCOMM
2009
ACM
14 years 2 months ago
2009
ACM
Many network applications have stringent end-to-end latency requirements, including VoIP and interactive video conferencing, automated trading, and high-performance computing—wh...