2553 search results - page 140 / 511 » Modeling Trees with Hypertextures |
138
Voted
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
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...
123
Voted
DCC
2005
IEEE
16 years 3 months ago
2005
IEEE
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...
138
Voted
PRDC
2008
IEEE
15 years 10 months ago
2008
IEEE
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...
127
Voted
SMI
2005
IEEE
15 years 9 months ago
2005
IEEE
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...
149
Voted
DSVIS
2005
Springer
15 years 9 months ago
2005
Springer
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 ...