• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4030
  • 1194
  • 508
  • 267
  • 200
  • 119
  • 91
  • 45
  • 45
  • 45
  • 45
  • 45
  • 45
  • 43
  • 34
  • Tagged with
  • 8123
  • 2353
  • 1599
  • 1090
  • 1068
  • 1040
  • 1007
  • 957
  • 896
  • 896
  • 820
  • 769
  • 710
  • 519
  • 496
  • 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.

Implementation and comparison of key-finding algorithms

Kim, Chang Young January 1976 (has links)
No description available.

A Multivariate Adaptive Trimmed Likelihood Algorithm

Daniel.Schubert@csiro.au, Daniel Schubert January 2005 (has links)
The research reported in this thesis describes a new algorithm which can be used to robustify statistical estimates adaptively. The algorithm does not require any pre-specified cut-off value between inlying and outlying regions and there is no presumption of any cluster configuration. This new algorithm adapts to any particular sample and may advise the trimming of a certain proportion of data considered extraneous or may divulge the structure of a multi-modal data set. Its adaptive quality also allows for the confirmation that uni-modal, multivariate normal data sets are outlier free. It is also shown to behave independently of the type of outlier, for example, whether applied to a data set with a solitary observation located in some extreme region or to a data set composed of clusters of outlying data, this algorithm performs with a high probability of success.

Algorithms for presenting subgroups

Kipnis, Evan Jonathan. January 1978 (has links)
No description available.

Lower bounds for parallel algorithms /

Shah, Pradyut. January 2001 (has links)
Thesis (Ph. D.)--University of Chicago, Dept. of Computer Science, August 2001. / Includes bibliographical references. Also available on the Internet.

Fast algorithms for NP-hard problems which are optimal or near-optimal with probability one

Terada, Routo. January 1979 (has links)
Thesis--University of Wisconsin--Madison. / Typescript. Vita. Description based on print version record. Includes bibliographical references (leaves 120-123).

Analysis of speedup in distributed algorithms

Fishburn, John Philip. January 1900 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1981. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 171-175).

A decimal algorithm for minimizing Boolean functions

Duley, James Robert, January 1963 (has links)
Thesis (M.S.)--University of Wisconsin--Madison, 1963. / Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaf 66).

Ahmes expansions over certain Euclidean domains a thesis presented to the faculty of the Graduate School, Tennessee Technological University /

Houston, Matthew. January 2009 (has links)
Thesis (M.S.)--Tennessee Technological University, 2009. / Title from title page screen (viewed on Aug. 12, 2009). Bibliography: leaves 28-29.

Universal computing systems /

Nelson, Thomas Clayton. January 1970 (has links)
Thesis (Ph. D.)--Oregon State University, 1970. / Typescript (photocopy). Includes bibliographical references (leaf 52). Also available on the World Wide Web.

Algorithms for the unitary eigenvalue problem

David, Roden Jason A., January 2007 (has links) (PDF)
Thesis (Ph. D.)--Washington State University, May 2007. / Includes bibliographical references (p. 97-101).

Page generated in 0.1183 seconds