Comparing classification tree structures : a special case of comparing -ary relations
Israël-César Lerman (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Comparing classification tree structures : a special case of comparing -ary relations II”
Comparing classification tree structures : a special case of comparing -ary relations
Search trees and bubble memories
Philippe Flajolet, Thomas Ottmann, Derick Wood (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Skip trees, an alternative data structure to skip lists in a concurrent approach
Xavier Messeguer (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A new class of balanced search trees : half-balanced binary search tress
H. J. Olivié (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Graphs and Betweeness
Milan Sekanina (1975)
Matematický časopis
Similarity:
Updating approximately complete trees
Tony W. Lai, Derick Wood (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A syntactic characterization of bounded-rank decision trees in terms of decision lists
Nicola Galesi (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: