Spelling suggestions: "subject:"data structures (computer)"" "subject:"data structures (coomputer)""
81 |
The dictionary problem : theory and practice /Lee, Ka-hing. January 1996 (has links)
Thesis (Ph. D.)--University of Hong Kong, 1996. / Includes bibliographical references (leaves 81-84).
|
82 |
Learning patterns in dynamic graphs with application to biological networksYou, Chang Hun. January 2009 (has links) (PDF)
Thesis (Ph. D.)--Washington State University, August 2009. / Title from PDF title page (viewed on Aug. 19, 2009). "School of Electrical Engineering and Computer Science." Includes bibliographical references (p. 114-117).
|
83 |
Succinct Data StructuresGupta, Ankur, January 2007 (has links)
Thesis (Ph. D.)--Duke University, 2007.
|
84 |
Conversion of flat files and hierarchical data basesNiemi, Timo. January 1985 (has links)
Thesis (Ph. D.)--University of Tampere, 1985. / Includes 4 papers published by the author in various journals. Includes bibliographical references (4 p. near end of text).
|
85 |
A new hierarchical clustering model for speeding up the reconciliation of XML-based, semistructured data in mediation systemsCharnyote Pluempitiwiriyawej. January 2001 (has links) (PDF)
Thesis (Ph. D.)--University of Florida, 2001. / Title from first page of PDF file. Document formatted into pages; contains xii, 122 p.; also contains graphics. Vita. Includes bibliographical references (p. 114-121).
|
86 |
Distribution system planning a set of new formulations and hybrid algorithms /Wang, Zhuding. January 2000 (has links) (PDF)
Thesis (Ph. D.)--University of Wisconsin--Milwaukee, 2000. / Major Professor: David C. Yu. Includes bibliographical references.
|
87 |
Information structures for single echelon organizationsJanuary 1982 (has links)
Debra A. Stabile, Alexander H. Levis, Susan A. Hall. / Bibliography: p. 44. / "January 1982" / "AFOSR-80-0229" "ONR-N00014-77-C-0532"
|
88 |
Theory of 3-4 heap : a thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in the University of Canterbury /Bethlehem, Tobias. January 2008 (has links)
Thesis (M. Sc.)--University of Canterbury, 2008. / Typescript (photocopy). Includes bibliographical references (p. 118-119). Also available via the World Wide Web.
|
89 |
Separating representation from translation of shared data in a heterogeneous computing environmentMullins, Robert W. 27 April 2010 (has links)
Master of Science
|
90 |
Ray Collection Bounding Volume HierarchyRivera, Kris Krishna 01 January 2011 (has links)
This thesis presents Ray Collection BVH, an improvement over a current day Ray Tracing acceleration structure to both build and perform the steps necessary to efficiently render dynamic scenes. Bounding Volume Hierarchy (BVH) is a commonly used acceleration structure, which aides in rendering complex scenes in 3D space using Ray Tracing by breaking the scene of triangles into a simple hierarchical structure. The algorithm this thesis explores was developed in an attempt at accelerating the process of both constructing this structure, and also using it to render these complex scenes more efficiently. The idea of using "ray collection" as a data structure was accidentally stumbled upon by the author in testing a theory he had for a class project. The overall scheme of the algorithm essentially collects a set of localized rays together and intersects them with subsequent levels of the BVH at each build step. In addition, only part of the acceleration structure is built on a per-Ray need basis. During this partial build, the Rays responsible for creating the scene are partially processed, also saving time on the overall procedure. Ray tracing is a widely used technique for simple rendering from realistic images to making movies. Particularly, in the movie industry, the level of realism brought in to the animated movies through ray tracing is incredible. So any improvement brought to these algorithms to improve the speed of rendering would be considered useful and iii welcome. This thesis makes contributions towards improving the overall speed of scene rendering, and hence may be considered as an important and useful contribution
|
Page generated in 0.07 seconds