• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 265
  • 52
  • 27
  • 25
  • 18
  • 10
  • 6
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 3
  • Tagged with
  • 467
  • 467
  • 350
  • 332
  • 179
  • 98
  • 63
  • 60
  • 56
  • 51
  • 50
  • 48
  • 48
  • 48
  • 46
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Novel algorithms for multi-objective search and their application in multi-objective evolutionary neural network training

Fieldsend, Jonathan E. January 2003 (has links)
No description available.
2

The dictionary problem: theory andpractice

Lee, Ka-hing., 李家興. January 1996 (has links)
published_or_final_version / Computer Science / Doctoral / Doctor of Philosophy
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

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.
5

Space-Efficient Data Structures for Information Retrieval

Claude, Francisco 22 April 2013 (has links)
The amount of data that people and companies store has grown exponentially over the last few years. Storing this information alone is not enough, because in order to make it useful we need to be able to efficiently search inside it. Furthermore, it is highly valuable to keep the historic data of each document stored, allowing to not only access and search inside the newest version, but also over the whole history of the documents. Grammar-based compression has proven to be very effective for repetitive data, which is the case for versioned documents. In this thesis we present several results on representing textual information and searching in it. In particular, we present text indexes for grammar-based compressed text that support searching for a pattern and extracting substrings of the input text. These are the first general indexes for grammar-based compressed text that support searching in sublinear time. In order to build our indexes, we present new results on representing binary relations in a space-efficient manner, and construction algorithms that use little space to achieve their goal. These two results have a wide range of applications. In particular, the representations for binary relations can be used as a building block for several structures in computer science, such as graphs, inverted indexes, etc. Finally, we present a new index, that uses on grammar-based compression, to solve the document listing problem. This problem deals with representing a collection of texts and searching for the documents that contain a given pattern. In spite of being similar to the classical text indexing problem, this problem has proven to be a challenge when we do not want to pay time proportional to the number of occurrences, but time proportional to the size of the result. Our proposal is designed particularly for versioned text, allowing the storage of a collection of documents with all their historic versions in little space. This is currently the smallest structure for such a purpose in practice.
6

Space-Efficient Data Structures for Information Retrieval

Claude, Francisco 22 April 2013 (has links)
The amount of data that people and companies store has grown exponentially over the last few years. Storing this information alone is not enough, because in order to make it useful we need to be able to efficiently search inside it. Furthermore, it is highly valuable to keep the historic data of each document stored, allowing to not only access and search inside the newest version, but also over the whole history of the documents. Grammar-based compression has proven to be very effective for repetitive data, which is the case for versioned documents. In this thesis we present several results on representing textual information and searching in it. In particular, we present text indexes for grammar-based compressed text that support searching for a pattern and extracting substrings of the input text. These are the first general indexes for grammar-based compressed text that support searching in sublinear time. In order to build our indexes, we present new results on representing binary relations in a space-efficient manner, and construction algorithms that use little space to achieve their goal. These two results have a wide range of applications. In particular, the representations for binary relations can be used as a building block for several structures in computer science, such as graphs, inverted indexes, etc. Finally, we present a new index, that uses on grammar-based compression, to solve the document listing problem. This problem deals with representing a collection of texts and searching for the documents that contain a given pattern. In spite of being similar to the classical text indexing problem, this problem has proven to be a challenge when we do not want to pay time proportional to the number of occurrences, but time proportional to the size of the result. Our proposal is designed particularly for versioned text, allowing the storage of a collection of documents with all their historic versions in little space. This is currently the smallest structure for such a purpose in practice.
7

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).
8

Multiprocessor scheduling with communications cost

Jarrell, 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).
9

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).
10

Strategies in searching hierarchical data structures /

Normore, Lorraine Dombrowski January 1986 (has links)
No description available.

Page generated in 0.1057 seconds