Spelling suggestions: "subject:"algorithms"" "subject:"a.lgorithms""
1 |
A study of a short term correlation algorithmVijayendra, Siravara January 2010 (has links)
Typescript (photocopy). / Digitized by Kansas Correctional Industries
|
2 |
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.
|
3 |
Algorithms for the unitary eigenvalue problemDavid, Roden Jason A., January 2007 (has links) (PDF)
Thesis (Ph. D.)--Washington State University, May 2007. / Includes bibliographical references (p. 97-101).
|
4 |
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.
|
5 |
Implementation and comparison of key-finding algorithmsKim, Chang Young January 1976 (has links)
No description available.
|
6 |
A parellel algorithm for solving a complex function f(z) = 0Cardelino, Carlos Antonio January 1985 (has links)
No description available.
|
7 |
Algorithms for presenting subgroupsKipnis, Evan Jonathan. January 1978 (has links)
No description available.
|
8 |
A Multivariate Adaptive Trimmed Likelihood AlgorithmDaniel.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.
|
9 |
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.
|
10 |
Fast algorithms for NP-hard problems which are optimal or near-optimal with probability oneTerada, Routo. January 1979 (has links)
Thesis--University of Wisconsin--Madison. / Typescript. Vita. Description based on print version record. Includes bibliographical references (leaves 120-123).
|
Page generated in 0.0467 seconds