84 search results - page 5 / 17 » Minimax Trees in Linear Time with Applications |
COMPGEOM
2000
ACM
13 years 12 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
IJCAI
1989
13 years 8 months ago
1989
We are interested here in the design of a very efficient Time-Map Manager, able to deal with a large knowledge-base of several thou sand time-tokens in demanding applications su...
DEXA
2010
Springer
13 years 7 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
ISBI
2004
IEEE
14 years 8 months ago
2004
IEEE
The techniques described in this paper allow multiscale photon-limited image reconstruction methods to be implemented with significantly less computational complexity than previou...
CORR
2010
Springer
13 years 7 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 ...