829 search results - page 94 / 166 » Bandit Algorithms for Tree Search |
131
Voted
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
129
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
130
click to vote
TOG
2008
15 years 3 months ago
2008
We present an algorithm for constructing kd-trees on GPUs. This algorithm achieves real-time performance by exploiting the GPU's streaming architecture at all stages of kd-tr...
142
Voted
ICIP
2010
IEEE
15 years 1 months ago
2010
IEEE
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
159
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...