Computer representation of a hierarchical tree structure that is representative of the organization of a data set or data dictionary, with each data item associated with a tree node. The representation comprises a table of values stored in a memory unit. The values are representative of the nodes...
In the current paper,we present a tree-like structure for the object representation in time-of-flight(TOF) datasets which enables an efficient computation of the object contour lines.The generated contour lines can be further processed in object detection and recognition for the TOF dataset.We ill...
Three succinct tree representations are explained in detail, and examples are given how to move between them. Not only the space occupancy of the data structure is important, but to support the navigational operations as quickly as possible. For this reason we introduce the RANK and SELECT ...
for generating a set of nodes representing a tree structure, each node comprising a feature index, a flag field indicating branch directions, an execution index storing locations related to the branch directions, and a feature value for comparing with the value stored in the input feature vector....
Cardinal trees (or tries of degree ) are a fundamental data structure, in particular for many text-processing algorithms. Each node in a cardinal tree has ... Arroyuelo,Davoodi,Satti,... - 《Algorithmica》 被引量: 7发表: 2016年
Structure-preserving crossover, STGP, CGP, and CFG-based GP give the user the power to reduce the space by specifying rules for valid tree construction, based on types, syntax, and heuristics. These rules in effect change the representation. However, in general the user may not be aware ...
We present, in this study a solution of this problem, based on the approach of Versions of Data bases, which consists in representing the colour images in the form of trees called Generic tree. This structure minimizes storage by sharing information between the images. This method makes it ...
You can find an old description of Firm in [TLB:99]. libFirm contains algorithms for construction of the SSA form directly from the attributed syntax tree. A set of analyses and optimization phases is provided. This version includes a complete backend for the IA32 and SPARC architecture, as ...
This paper presents the adaptation of tolerance transfer techniques to a model called TTRS for Technologically and Topologically Related Surfaces. According to this model, any three-dimensional part can be represented as a succession of surface associations forming a tree. Additional tolerancing informatio...
After revising the octree-based approach for implementing the topological operators in Section 4, the developed BRep-based approach is presented in Section 5. Section 6 discusses the application of the R-Tree indexing method for achieving further performance gains during topological filtering. The ...