Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 95 for “"Data structures (Computer science)"”.

  1. Enhanced classification through exploitation of hierarchical structures

    … often organize information by encoding it in structures that link together entities such as concepts, objects, properties etc. Among the various structures possible, hierarchies are commonly used. For instance, taxonomies of categories commonly employ hierarchies to indicate that one category …

    texas Repository record for Enhanced classification through exploitation of hierarchical structures (opens in a new tab)

  2. Every picture tells a story : an investigation of data models as tools of communication : a thesis presented in partial fulfillment of the requirements for the degree of Master of Information Sciences at Massey University,

    Data models are important in information system (IS) development, particularly as tools for expressing and communicating information business requirements. The ability to understand the information content of data models is a fundamental skill required by anyone involved with them. The aim of data …

    massey Repository record for Every picture tells a story : an investigation of data models as tools of communication : a thesis presented in partial fulfillment of the requirements for the degree of Master of Information Sciences at Massey University, (opens in a new tab)

  3. A paging scheme for pointer-based quadtrees

    The quadtree is a family of data structures that organize spatial data using recursive subdivision. A pointer-based quadtree uses an explicit tree structure to represent the subdivision, while a linear quadtree holds a sorted list of records corresponding to the leaves of the tree structure. Small …

    vt Repository record for A paging scheme for pointer-based quadtrees (opens in a new tab)

  4. Wilf-classification of mesh patterns of short length

    This B.Sc. project deals with mesh pattern avoidance in permutations. A mesh pattern is a pair P=(p,R), where p is a permutation of length k and R is a subset of [0,k]x[0,k]. The elements of R denote filled boxes in a mesh pattern. For a permutation u to contain a mesh pattern, it has to contain …

    reykjavik Repository record for Wilf-classification of mesh patterns of short length (opens in a new tab)

  5. Development and usage of information architecture

    … as being useful for IS planning, corporate data model is seen as being more relevant to data management and project implementation. Both models are regarded as tools facilitating integrated information systems development.</p> <p>In the second stage of research, case studies on 6 large …

    oxford Repository record for Development and usage of information architecture (opens in a new tab)

  6. An experimental spatial information system

    … describe a spatial information system. A spatial data structure is used as the building block of the system. Prototypes, a high level query language and an associated retrieval scheme particularly designed for the hierarchical and relational spatial data structure are discussed.

    vt Repository record for An experimental spatial information system (opens in a new tab)

  7. An experimental spatial information system

    Computer representation of the continuous two-dimensional features on a map is complicated by the spatial properties not found in typical alphanumeric data. We have designed an entity-oriented relational system for representing the cartographic data, using the concept of spatial data structures. …

    vt Repository record for An experimental spatial information system (opens in a new tab)

  8. Octree-based animated geometry compression

    … D.)--Michigan State University. Department of Computer Science and Engineering, 2005

    msu Repository record for Octree-based animated geometry compression (opens in a new tab)

  9. Analytic modelling of agent-based network routing algorithms.

    Interest in adaptive and distributed systems for routing control in networks has led to the development of a new class of algorithms, which is inspired by the shortest path finding behaviours observed in biological ant colonies. This class utilizes ant-like agents, which autonomously traverse the …

    adelaide Repository record for Analytic modelling of agent-based network routing algorithms. (opens in a new tab)

Page 1 of 5