172 search results - page 22 / 35 » On the cost of searching signature trees |
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
AAAI
2006
13 years 9 months ago
2006
Much of the work on opponent modeling for game tree search has been unsuccessful. In two-player, zero-sum games, the gains from opponent modeling are often outweighed by the cost ...
VLDB
2001
ACM
13 years 12 months ago
2001
ACM
A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the se...
CPM
2008
Springer
13 years 9 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...
IANDC
2008
13 years 7 months ago
2008
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...