829 search results - page 159 / 166 » Bandit Algorithms for Tree Search |
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
CCO
2001
Springer
14 years 29 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
FOCS
1998
IEEE
14 years 21 days ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
TIP
2002
13 years 8 months ago
2002
1 Recently the authors proposed a Look Up Table (LUT) based method for inverse halftoning of images. The LUT for inverse halftoning is obtained from the histogram gathered from a f...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Scalable image retrieval systems usually involve hierarchical quantization of local image descriptors, which produces a visual vocabulary for inverted indexing of images. Although ...