Sciweavers

2553 search results - page 140 / 511
» Modeling Trees with Hypertextures
Sort
View
ICML
2009
IEEE
15 years 4 months ago
Decision tree and instance-based learning for label ranking
The label ranking problem consists of learning a model that maps instances to total orders over a finite set of predefined labels. This paper introduces new methods for label ra...
Weiwei Cheng, Jens C. Huhn, Eyke Hüllermeier
DCC
2005
IEEE
15 years 9 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 4 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...
SMI
2005
IEEE
111views Image Analysis» more  SMI 2005»
15 years 3 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...
DSVIS
2005
Springer
15 years 3 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...