Searching for "Leaf Trees." – sorted by Relevance.
-
Convex Recoloring of Leaf-Colored Trees
- Convex recoloring of leaf-colored trees Emgad H. Bachoore Hans L. Bodlaender Department
- Cited by 1 (0 self) – Add To MetaCart
-
On Graph Powers For Leaf-Labeled Trees
- On graph powers for leaf-labeled trees Naomi Nishimura * Prabhakar Ragde y Department
- Cited by 10 (0 self) – Add To MetaCart
-
Regular Leaf Languages and (Non-)Regular Tree Shapes
- Regular Leaf Languages and (Non-) Regular Tree Shapes U. Hertrampf Theoretische Informatik
- Cited by 3 (0 self) – Add To MetaCart
-
Computers Graphics 23 (1999) 645}654
- parameter space using a 5D tree (a k-D tree with k"5), such that each leaf of the tree contains a reference
- Add To MetaCart
-
A Comparison of Genetic Programming Variants for Data Classification
- is not performed at the root, but at the leafs of the trees and only Boolean functions are used in the trees' body
- Cited by 10 (1 self) – Add To MetaCart
-
Hybrid Trees for Supervised Learning: Towards Extraction of Decision Rules
- decision rules associated with each leaf of the tree. The interpretability of the rule depends
- Add To MetaCart
-
Agglomerative Hierarchical Clustering For Musical Database Visualization and Browsing
- leaf of the tree represents a music file and musical similarity decreases with height. Additionally
- Cited by 5 (4 self) – Add To MetaCart
-
Concurrency control for b-trees with differential indices
- batch-update operation. Thus, updates falling into the same leaf of the tree can be performed
- Cited by 2 (0 self) – Add To MetaCart
-
Salvage-embeddings of complete trees
- the same edge of H. We consider three scenarios for an N-leaf tree H. In the worst-case scenario
- Cited by 1 (1 self) – Add To MetaCart
-
Maximum Agreement and Compatible Supertrees
- . Given a collection £ of trees on leaves with identical leaf set, the MAST, resp. MCT, problem consists
- Cited by 7 (4 self) – Add To MetaCart

