829 search results - page 97 / 166 » Bandit Algorithms for Tree Search |
102
click to vote
ISPD
2004
ACM
15 years 3 months ago
2004
ACM
Modern processors and SoCs require the adoption of poweroriented design styles, due to the implications that power consumption may have on reliability, cost and manufacturability ...
CPM
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
AINA
2010
IEEE
15 years 2 months ago
2010
IEEE
—Packet classification problem has received much attention and continued to be an important topic in recent years. In packet classification problem, each incoming packet should b...
SIAMCOMP
1998
14 years 9 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
SIGIR
2005
ACM
15 years 3 months ago
2005
ACM
Recognition and retrieval of historical handwritten material is an unsolved problem. We propose a novel approach to recognizing and retrieving handwritten manuscripts, based upon ...