327 search results - page 45 / 66 » Algorithms for infinite huffman-codes |
ATAL
2008
Springer
13 years 8 months ago
2008
Springer
We present Tartanian, a game theory-based player for headsup no-limit Texas Hold'em poker. Tartanian is built from three components. First, to deal with the virtually infinit...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
ACL
2010
13 years 4 months ago
2010
Learning a tree substitution grammar is very challenging due to derivational ambiguity. Our recent approach used a Bayesian non-parametric model to induce good derivations from tr...
CVPR
2009
IEEE
15 years 1 months ago
2009
IEEE
Most modern computer vision systems for high-level
tasks, such as image classification, object recognition and
segmentation, are based on learning algorithms that are
able to se...