1326 search results - page 107 / 266 » Approximate Tree Kernels |
JMLR
2010
13 years 3 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
EMNLP
2010
13 years 6 months ago
2010
In this paper we introduce the new task of social event extraction from text. We distinguish two broad types of social events depending on whether only one or both parties are awa...
CIKM
2006
Springer
14 years 17 days ago
2006
Springer
We present a hierarchical tree structure for online maintenance of time-decaying synopses over streaming data. We exemplify such an amnesic behavior over streams of locations take...
ICRA
2008
IEEE
14 years 3 months ago
2008
IEEE
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
EWRL
2008
13 years 10 months ago
2008
A wide variety of function approximation schemes have been applied to reinforcement learning. However, Bayesian filtering approaches, which have been shown efficient in other field...