1326 search results - page 164 / 266 » Approximate Tree Kernels |
112
click to vote
SIROCCO
2004
15 years 3 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
127
Voted
AAAI
2012
13 years 4 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
137
click to vote
VMCAI
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Device drivers often keep data in multiple data structures simultaneously while embedding list or tree related records into the records containing the actual data; this r...
130
click to vote
AISADM
2005
Springer
15 years 8 months ago
2005
Springer
Meta-learning system for KDD is an open and evolving platform for efficient testing and intelligent recommendation of data mining process. Metalearning is adopted to automate the s...
141
click to vote
AIPS
2006
15 years 3 months ago
2006
In this paper, we present a motion planning framework for a fully deployed autonomous unmanned aerial vehicle which integrates two sample-based motion planning techniques, Probabi...