2069 search results - page 361 / 414 » Linear time algorithms for Clobber |
175
click to vote
VMV
2001
15 years 7 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
142
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
174
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
156
click to vote
IPL
2006
15 years 5 months ago
2006
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
222
Voted
JCO
2006
15 years 5 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...