829 search results - page 41 / 166 » Bandit Algorithms for Tree Search |
ICMCS
2009
IEEE
14 years 7 months ago
2009
IEEE
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
101
Voted
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
DAGM
2005
Springer
15 years 3 months ago
2005
Springer
The paper addresses the region search problem in three-dimensional (3D) space. The data used is a dynamically growing point cloud as it is typically gathered with a 3D-sensing devi...
NIPS
2004
14 years 11 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
EOR
2008
14 years 9 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...