Title

Schemes for SR-tree packing

Alternative Title

Schemes for SR Tree packing

Abstract

"In this thesis, schemes for SR-Tree packing, based on different pre-processing techniques for static datasets, are studied. The schemes have been implemented and the results are presented after an extensive comparative study of the algorithms over the synthetic and real datasets from application domains such as VLSI design and image databases."--Abstract, page iii.

Department(s)

Computer Science

Degree Name

M.S. in Computer Science

Publisher

University of Missouri--Rolla

Publication Date

Summer 2003

Pagination

x, 87 leaves

Rights

© 2003 Jayendra Gnanaskandan Venkateswaran, All rights reserved.

Document Type

Thesis - Citation

File Type

text

Language

English

Library of Congress Subject Headings

Trees (Graph theory)
Data structures (Computer science)

Thesis Number

T 8334

Print OCLC #

54884179

Link to Catalog Record

Full-text not available: Request this publication directly from Missouri S&T Library or contact your local library.

http://laurel.lso.missouri.edu/record=b5073179~S5

This document is currently not available here.

Share

 
COinS