Updating approximately complete trees
Tony W. Lai, Derick Wood (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Decision tree design by simulated annealing”
Updating approximately complete trees
Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems.
Bar-Yehuda, Reuven, Even, Guy, Feldmann, Jon, Naor, Joseph (2001)
Journal of Graph Algorithms and Applications
Similarity:
An axiomatic theory of information trees
Keh-Hsun Chen, Zbigniew W. Ras (1988)
Banach Center Publications
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:
Search trees and bubble memories
Philippe Flajolet, Thomas Ottmann, Derick Wood (1985)
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:
A Note on Spanning Trees for Network Location Problems
Dionisio Pérez-Brito, Nenad Mladenović, José A. Moreno-Pérez (1998)
The Yugoslav Journal of Operations Research
Similarity:
Multidimensional term indexing for efficient processing of complex queries
Michal Krátký, Tomáš Skopal, Václav Snášel (2004)
Kybernetika
Similarity:
The area of Information Retrieval deals with problems of storage and retrieval within a huge collection of text documents. In IR models, the semantics of a document is usually characterized using a set of terms. A common need to various IR models is an efficient term retrieval provided via a term index. Existing approaches of term indexing, e. g. the inverted list, support efficiently only simple queries asking for a term occurrence. In practice, we would like to exploit some more sophisticated...