829 search results - page 3 / 166 » Bandit Algorithms for Tree Search |
TCS
2008
13 years 7 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
An algorithm for finding coupling points plays an important role in the Iterative Closest Point algorithm (ICP) which is widely used in registration applications in medical and 3-...
ISAAC
2003
Springer
14 years 17 days ago
2003
Springer
Abstract. We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Search engines today present results that are often oblivious to recent shifts in intent. For example, the meaning of the query `independence day' shifts in early July to a U...
SDM
2012
SIAM
11 years 9 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...