We introduce an original perfect balancing to cope with the load variation due to the priority queue operations which continuously modify the overall number of items in the network. For comparison, we introduce the d-heap and the binomial distributed priority queue. In particular, we show that the d-heap combines an adjustable degree with a small depth, which make it efficient in both theory and practice. The need for segmentation is determined by region statistics and segmentation is actually performed using edge based information. Results are shown for a number of images displaying significant improvements over mono-scale segmentation.
Boomerang is a dynamic HTML page reconfiguration system.
A user accesses Boomerang via the Common Gateway Interface. The user supplies a page name and a template , Boomerang fetches the requested page and uses the template to reconfigure it. The template is a sequence of string manipulation rules. The rules are written in a simple regular expression-based pattern matching language. Boomerang also parses HTML variables in forms and query strings and makes those variables available in the template.