Schemes for SR-tree packing
Schemes for SR Tree packing
"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.
M.S. in Computer Science
University of Missouri--Rolla
x, 87 leaves
© 2003 Jayendra Gnanaskandan Venkateswaran, All rights reserved.
Thesis - Citation
Library of Congress Subject Headings
Trees (Graph theory)
Data structures (Computer science)
Print OCLC #
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
Venkateswaran, Jayendra Gnanaskandan, "Schemes for SR-tree packing" (2003). Masters Theses. 2396.
Share My Thesis If you are the author of this work and would like to grant permission to make it openly accessible to all, please click the button above.