Literaturnachweis - Detailanzeige
Autor/inn/en | Lin, Jianhua; und weitere |
---|---|
Titel | Optimal Pruning for Tree-Structured Vector Quantization. |
Quelle | In: Information Processing and Management, 28 (1992) 6, S.723-33 |
Sprache | englisch |
Dokumenttyp | gedruckt; Zeitschriftenaufsatz |
ISSN | 0306-4573 |
Schlagwörter | Algorithms; Coding; Computation; Information Processing; Mathematical Formulas |
Abstract | Analyzes the computational complexity of optimal binary tree pruning for tree-structured vector quantization. Topics discussed include the combinatorial nature of the optimization problem; the complexity of optimal tree pruning; and finding a minimal size pruned tree. (11 references) (LRW) |
Erfasst von | ERIC (Education Resources Information Center), Washington, DC |