Spelling suggestions: "subject:"data structures (computer science)"" "subject:"data structures (aomputer science)""
1 |
The dictionary problem: theory andpracticeLee, Ka-hing., 李家興. January 1996 (has links)
published_or_final_version / Computer Science / Doctoral / Doctor of Philosophy
|
2 |
Separating representation for translation of shared data in a heterogeneous computing environment /Mullins, Robert W., January 1993 (has links)
Report (M.S.)--Virginia Polytechnic Institute and State University. M.S. 1993. / Vita. Abstract. Includes bibliographical references (leaves 81-83). Also available via the Internet.
|
3 |
Local and personalised models for prediction, classification and knowledge discovery on real world data modelling problems a thesis submitted to Auckland University of Technology in fulfilment of the requirements for the degree of Doctor of Philosophy, 2009 /Hwang, Yuan-Chun January 2009 (has links)
Thesis (PhD) -- AUT University, 2009. / Includes bibliographical references. Also held in print (xi, 190 leaves : ill. ; 30 cm.) in the Archive at the City Campus (T 005.73 HWA)
|
4 |
Representation of d-dimensional geometric objects /Brisson, Erik, January 1990 (has links)
Thesis (Ph. D.)--University of Washington, 1990. / Vita. Includes bibliographical references (leaves [159]-165).
|
5 |
Algorithms for proximity problems in the presence of obstacles /Mak, Vivian. January 1999 (has links)
Thesis (M. Phil.)--University of Hong Kong, 2000. / Includes bibliographical references (leaves 101-103).
|
6 |
Multiprocessor scheduling with communications costJarrell, Nancy Faye. January 1900 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1983. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 94-95).
|
7 |
Algorithms and data structures for the implimentation of a relational database systemOrenstein, J. A. January 1982 (has links)
The problems of implementing a relational database are considered. In part 1, a new class of data structures for processing range queries is described. A member of this class is derived from a data structure which supports random and sequential accessing. We also describe two new data structures with this property that seem to have better performance than the Btree. In part 2, a new design for the physical database is proposed. This design is based on the separation of a relation into two parts: a static "master file" and a dynamic "differential file" which stores updates. Our design includes a new system for recovering from system failures and allows greater concurrency than is possible with existing systems.
|
8 |
Multipaged implementation of MRDS on UNIXPal, Jatinder. January 1984 (has links)
No description available.
|
9 |
Data-structure builder for VLSI/CAD softwareEum, Doo-hun 19 October 1990 (has links)
Relational database systems have successfully solved many
business data processing problems. The primary reason of this
success is that the relational data model provides a simple, yet
flexible view of data as tables. In studying VLSI/CAD data, we noticed
that they are often represented in formats similar to relational
tuples. Therefore, they can be stored easily in relational tables.
However, it is generally agreed that conventional relational database
systems are inefficient for VLSI/CAD applications, since such
applications often access large amounts of data repetitively.
In order to solve this problem, we designed and implemented a
data mapping subsystem that converts VLSI/CAD data stored in
relational tables into internal data structures so that they can be
efficiently manipulated in C. By using our data mapping language, we
could reduce the amount of code required by the data-structure
construction parts of some real VLSI/ CAD tools to about 1/10 of that
required by C implementation. Our data-structure builder consumes
several times more CPU cycles. / Graduation date: 1991
|
10 |
Enhanced classification through exploitation of hierarchical structuresPunera, Kunal Vinod Kumar 28 August 2008 (has links)
Not available / text
|
Page generated in 0.1575 seconds