Sciweavers

14403 search results - page 80 / 2881
» Dynamical Systems Trees
Sort
View
MSV
2004
13 years 11 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko
RT
1997
Springer
14 years 2 months ago
Incremental Updates to Scenes Illuminated by Area Light Sources
Abstract: An object space algorithm for computing shadows in dynamic scenes illuminated by area light sources is presented. A mesh with the shadow boundaries as well as other disco...
Yiorgos Chrysanthou, Mel Slater
AUTONOMICS
2008
ACM
14 years 22 hour ago
Building multicast trees in ad-hoc networks
Multicast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produc...
Raphaël Kummer, Peter G. Kropf, Pascal Felber