172 search results - page 3 / 35 » On the cost of searching signature trees |
CIAC
2003
Springer
14 years 22 days ago
2003
Springer
SIAMCOMP
1998
13 years 7 months ago
1998
ISAAC
2003
Springer
14 years 20 days ago
2003
Springer
Abstract. We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search ...
LION
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
AAAI
1996
13 years 8 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...