Andere Kunden interessierten sich auch für
![Chow- Liu Tree]( "Chow- Liu Tree")
Chow- Liu Tree22,99 €![Abstract Syntax Tree]( "Abstract Syntax Tree")
Abstract Syntax Tree34,00 €![From Bandits to Monte-Carlo Tree Search]( "From Bandits to Monte-Carlo Tree Search")
From Bandits to Monte-Carlo Tree Search106,99 €![THE RECTILINEAR STEINER TREE PROBLEM]( "THE RECTILINEAR STEINER TREE PROBLEM")
THE RECTILINEAR STEINER TREE PROBLEM32,99 €![Tree-Based Machine Learning Methods in SAS Viya]( "Tree-Based Machine Learning Methods in SAS Viya")
Tree-Based Machine Learning Methods in SAS Viya95,99 €![Data Structures and Algorithms]( "Data Structures and Algorithms")
Data Structures and Algorithms44,99 €![Information Flow Security in Tree-Manipulating Processes]( "Information Flow Security in Tree-Manipulating Processes")
Information Flow Security in Tree-Manipulating Processes44,99 €
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, an X-tree is an index tree structure based on the R-tree used for storing data in many dimensions. It differs from R-trees, R+ trees and R trees because it emphasizes prevention of overlap in the bounding boxes. In cases where nodes cannot be split without preventing overlap, the node split will be deferred, resulting in super-nodes. In extreme cases, the tree will linearize, which defends against worst-case behaviors observed in some other data structures.