785 search results - page 58 / 157 » Binary Join Trees |
137
click to vote
ADBIS
1999
Springer
15 years 8 months ago
1999
Springer
In this paper we propose and analyze a new spatial access method, namely the S∗ -tree, for the efficient secondary memory encoding and manipulation of images containing multiple ...
128
click to vote
PODS
2007
ACM
16 years 4 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
156
click to vote
WADS
2009
Springer
15 years 11 months ago
2009
Springer
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...
121
click to vote
ICCS
2004
Springer
15 years 9 months ago
2004
Springer
To improve popular services discovery mechanism (UDDI mainly), we propose an agent-based services discovery mechanism. In this mechanism, services information is stored in distribu...
124
click to vote
BROADBAND
1998
15 years 5 months ago
1998
In this paper, a method for calculating blocking experienced by dynamic multicast connections in a single link is presented. A service center at the root of a tree-type network pr...