Journal Article10.1007/BF00264289
Optimum binary search trees
About: This article is published in Acta Informatica. The article was published on 01 Mar 1971. The article focuses on the topics: Geometry of binary search trees & Binary search tree.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A survey of decision tree classifier methodology
S.R. Safavian,David A. Landgrebe +1 more
- 01 Jun 1991
TL;DR: The subjects of tree structure design, feature selection at each internal node, and decision and search strategies are discussed, and the relation between decision trees and neutral networks (NN) is also discussed.
Self-adjusting binary search trees
TL;DR: The splay tree, a self-adjusting form of binary search tree, is developed and analyzed and is found to be as efficient as balanced trees when total running time is the measure of interest.
1.4K
Recent trends in hierarchic document clustering: a critical review
TL;DR: Algorithms that can be used to allow the implementation of hierarchic agglomerative clustering methods for document retrieval, and experimental evidence suggests that nearest neighbor clusters provide a reasonably efficient and effective means of including interdocument similarity information in document retrieval systems.
883
Data compression
TL;DR: A variety of data compression methods are surveyed, from the work of Shannon, Fano, and Huffman in the late 1940s to a technique developed in 1986, which has important application in the areas of file storage and distributed systems.
613
Optimal Computer Search Trees and Variable-Length Alphabetical Codes
T. C. Hu,Alan Tucker +1 more
TL;DR: An algorithm is given for constructing an alphabetic binary tree of minimum weighted path length (for short, an optimalAlphabetic tree), where n is the number of terminal nodes in the tree.
336
References
Matrix Iterative Analysis
J. H. Bramble,Richard S. Varga +1 more
Abstract: Matrix Properties and Concepts.- Nonnegative Matrices.- Basic Iterative Methods and Comparison Theorems.- Successive Overrelaxation Iterative Methods.- Semi-Iterative Methods.- Derivation and Solution of Elliptic Difference Equations.- Alternating-Direction Implicit Iterative Methods.- Matrix Methods for Parabolic Partial Differential Equations.- Estimation of Acceleration Parameters.
6.8K
•Book
Matrix iterative analysis
Richard S. Varga
- 30 Nov 1961
TL;DR: In this article, the authors propose Matrix Methods for Parabolic Partial Differential Equations (PPDE) and estimate of Acceleration Parameters, and derive the solution of Elliptic Difference Equations.
5.8K
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
TL;DR: A container closure assembly for maintaining a sterile sealed container is provided having a ferrule having a central opening in the top annular portion, upwardly projecting locking portions about the periphery of the opening and a weakening line radially outwardly of and concentric with the locking portions.
2.8K
An efficient context-free parsing algorithm
TL;DR: In this article, a parsing algorithm which seems to be the most efficient general context-free algorithm known is described, which is similar to both Knuth's LR(k) algorithm and the familiar top-down algorithm.
•Book
A Programming Language
Kenneth E. Iverson
- 01 Jan 1962
TL;DR: The paper describes a succinct problem-oriented programming language that relies heavily on a systematic extension of a small set of basic operations to vectors, matrices, and trees, and on a family of flexible selection operations controlled by logical vectors.
1.1K