785 search results - page 18 / 157 » Binary Join Trees |
TIP
1998
14 years 9 months ago
1998
—We present a method of estimating the shape of a weakly scattering binary convex polygonal object from the backscattered field. We use the concept scattering centers where it h...
ESA
2006
Springer
14 years 11 months ago
2006
Springer
We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant...
GRID
2005
Springer
15 years 3 months ago
2005
Springer
Abstract— We propose a method for wide-area message passing systems to perform collective operations using dynamically created spanning trees. In our proposal, broadcasts and red...
101
click to vote
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
IWQOS
2001
Springer
15 years 2 months ago
2001
Springer
QoS support poses new challenges to multicast routing especially for inter-domain multicast where network QoS characteristics will not be readily available as in intra-domain multi...