Sciweavers

272 search results - page 21 / 55
» Lazy tree splitting
Sort
View
NETWORKING
2010
13 years 9 months ago
Cost Bounds of Multicast Light-Trees in WDM Networks
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
Fen Zhou, Miklós Molnár, Bernard Cou...
LCN
2008
IEEE
14 years 2 months ago
Avoidance of multicast incapable branching nodes for multicast routing in WDM networks
— Although many multicast routing algorithms have been proposed in order to reduce the total cost in WDM optical networks, the link stress and delay are two parameters which are ...
Fen Zhou, Miklós Molnár, Bernard Cou...
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
14 years 9 months ago
SD-Rtree: A Scalable Distributed Rtree
We propose a scalable distributed data structure (SDDS) called SD-Rtree. We intend our structure for point and window queries over possibly large spatial datasets distributed on c...
Cédric du Mouza, Philippe Rigaux, Witold Li...
PR
2010
160views more  PR 2010»
13 years 6 months ago
Homeomorphic alignment of weighted trees
Motion capture, a currently active research area, needs estimation of the pose of the subject. For this purpose, we match the tree representation of the skeleton of the 3D shape t...
Benjamin Raynal, Michel Couprie, Venceslas Biri
SMI
2006
IEEE
186views Image Analysis» more  SMI 2006»
14 years 1 months ago
BSP Shapes
We discuss a shape representation based on a set of disconnected (planar) polygons. The polygons are computed by creating a BSP that contains approximately linear surface patches ...
Carsten Stoll, Hans-Peter Seidel, Marc Alexa