NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 7
  • 1
  • Tagged with
  • 8
  • 8
  • 5
  • 5
  • 5
  • 4
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 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.

Search results

Showing 1 to 8 of 8 (0.07 seconds)

Spelling suggestions: "subject:"interval functions."" "subject:"8interval functions.""

1

Aspects of Universality in Function Iteration

Taylor, John (John Allen) 12 1900 (has links)
This work deals with some aspects of universal topological and metric dynamic behavior of iterated maps of the interval.
Interval functions.
Topological dynamics.
Mappings (Mathematics)
universality
function iteration
2

Nonproportional hazards regression models for survival analysis

Zhang, Zhigang, January 2004 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 2004. / Typescript. Vita. Includes bibliographical references (leaves 46-54). Also available on the Internet.
3

Nonproportional hazards regression models for survival analysis /

Zhang, Zhigang, January 2004 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 2004. / Typescript. Vita. Includes bibliographical references (leaves 46-54). Also available on the Internet.
4

Minimální reprezentace víceintervalových booleovských funkcí / Minimální reprezentace víceintervalových booleovských funkcí

Bártek, Filip January 2015 (has links)
When we interpret the input vector of a Boolean function as a binary number, we define interval Boolean function fn [a,b] so that fn [a,b](x) = 1 if and only if a ≤ x ≤ b. Disjunctive normal form is a common way of representing Boolean functions. Minimization of DNF representation of an interval Boolean function can be per- formed in linear time. The natural generalization to k-interval functions seems to be significantly harder to tackle. In this thesis, we discuss the difficulties with finding an optimal solution and introduce a 2k-approximation algorithm.
5

Vlastnosti intervalových booleovských funkcí / Properties of interval Boolean functions

Hušek, Radek January 2014 (has links)
Boolean function f is k-interval if - input vector viewed as n-bit number - f is true for and only for inputs from given (at most) k intervals. Recognition of k-interval fuction given its DNF representation is coNP-hard problem. This thesis shows that for DNFs from a given solvable class (class C of DNFs is solvable if we can for any DNF F ∈ C decide F ≡ 1 in polynomial time and C is closed under partial assignment) and fixed k we can decide whether F represents k-interval function in polynomial time. 1
6

Nonparametric analysis of interval-censored failure time data

Gorelick, Jeremy, Sun, Jianguo, January 2009 (has links)
Title from PDF of title page (University of Missouri--Columbia, viewed on Feb 26, 2010). The entire thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file; a non-technical public abstract appears in the public.pdf file. Dissertation advisor: Dr. (Tony) Jianguo Sun. Includes bibliographical references.
7

Nonparametric treatment comparisons for interval-censored failure time data

Zhao, Qiang, January 2004 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 2004. / Typescript. Vita. Includes bibliographical references (leaves 73-77). Also available on the Internet.
8

Nonparametric treatment comparisons for interval-censored failure time data /

Zhao, Qiang, January 2004 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 2004. / Typescript. Vita. Includes bibliographical references (leaves 73-77). Also available on the Internet.

Page generated in 0.0843 seconds