316 search results - page 12 / 64 » Bounded Depth Data Trees |
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
IDEAS
2008
IEEE
14 years 3 months ago
2008
IEEE
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
DSN
2006
IEEE
14 years 3 months ago
2006
IEEE
This paper addresses the problem of fault resilience of overlay-based live media streaming from two aspects: (1) how to construct a stable multicast tree that minimizes the negati...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
AINA
2008
IEEE
13 years 11 months ago
2008
IEEE
It is important to design an energy efficient data gathering tree structure for wireless sensor networks. As for the energy efficiency, network's overall energy consumption an...