Sciweavers

2912 search results - page 170 / 583
» Logistic Model Trees
Sort
View
125
Voted
DCC
2005
IEEE
16 years 3 months ago
Coding the Wavelet Spatial Orientation Tree with Low Computational Complexity
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
Yushin Cho, Amir Said, William A. Pearlman
PRDC
2008
IEEE
15 years 10 months ago
On the Complexity of a Self-Stabilizing Spanning Tree Algorithm for Large Scale Systems
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the appli...
Julien Clement, Thomas Hérault, Stép...
128
Voted
SMI
2005
IEEE
111views Image Analysis» more  SMI 2005»
15 years 9 months ago
The Half-Edge Tree: A Compact Data Structure for Level-of-Detail Tetrahedral Meshes
We propose a new data structure for the compact encoding of a Level-Of-Detail (LOD) model of a threedimensional scalar field based on unstructured tetrahedral meshes. Such data s...
Emanuele Danovaro, Leila De Floriani, Paola Magill...
150
Voted
DSVIS
2005
Springer
15 years 9 months ago
Mapping ConcurTaskTrees into UML 2.0
Abstract. The ConcurTaskTrees (CTT) is one of the most widely used notations for task modeling, specifically tailored for user interface model-based design. The integration of CTT ...
Leonel Nóbrega, Nuno Jardim Nunes, Helder C...
129
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
Minimum Power Broadcast Trees for Wireless Networks: Integer Programming Formulations
— Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all...
Arindam Kumar Das