Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 7399 for “"bounds"”.

  1. Improved upper bounds and lower bounds on broadcast function

    … construct broadcast graphs and to obtain upper bounds on B(n). In this thesis, we study the compounding and the vertex addition broadcast graph constructions, which improve the upper bound on B(n). We also present the first nontrivial general lower bound on B(n).

    concordia Download PDF for Improved upper bounds and lower bounds on broadcast function (opens in a new tab)

  2. Beating the bounds

    A framework capable of escaping the bipolarities inherent in traditional urban/suburban classifications is designed not only for the analysis of historical form, but also as a means of identifying more affective modes of operation for the architectural and urban planning professions in an …

    rice Repository record for Beating the bounds (opens in a new tab)

  3. Optimal confidence bounds

    <p>Optimum confidence bounds proposed by Buehler (1957), primarily for functions of the parameters of distributions on finite sample spaces, are investigated in several directions. These investigations include consideration of: questions of existence and construction, order-restricted optimal …

    iastate Repository record for Optimal confidence bounds (opens in a new tab)

  4. Building Within Our Bounds

    This graduate thesis explores where waste (or unutilized material) is being produced in the design methodology of a mixed-use building in Fargo, ND. There is waste produced in the construction process that is inevitable, but the majority of waste can be attributed to the decision making process of …

    ndsu Repository record for Building Within Our Bounds (opens in a new tab)

  5. Bounds on Aggregate Assets

    … structure by way of finding analytical bounds. Our first method uses the Fréchet-Hoeffding copula bounds to calculate model-free upper and lower bounds for aggregate assets evaluation. For the copulas with specific constraints, we improve the Fréchet- Hoeffding copula bounds by …

    waterloo Repository record for Bounds on Aggregate Assets (opens in a new tab)

  6. Lower Bounds and Derandomization

    A major open problem in complexity theory is to determine whether randomized complexity classes such as BPP, AM, and MA have any nontrivial derandomization. This thesis investigates the derandomization of two randomized versions of the polynomial hierarchy.

    waterloo Repository record for Lower Bounds and Derandomization (opens in a new tab)

  7. Branching Program Lower Bounds

    … solution ? To begin, we prove exponential lower bounds on the size of a restricted model of branching programs called semantic read-once 3-ary nondeterministic branching programs solving a polytime computable function, in particular the polynomial evaluation problem. In the second part, we prove …

    toronto-retro Repository record for Branching Program Lower Bounds (opens in a new tab)

  8. The Bounds of Justification

    In the Theaetetus, Socrates proposes that knowledge is true belief that is accounted for or justified. The question that intuitively follows is what the proper structure of a justifying account of true belief is. Answers to this question are available throughout the history of philosophy and are …

    queens Repository record for The Bounds of Justification (opens in a new tab)

  9. Finite Sampling Exponential Bounds

    This dissertation develops new exponential bounds for the tail of the hypergeometric distribution. It is organized as follows. In Chapter 1, it reviews existing exponential bounds used to control the hypergeometric tail. In Chapter 2, it extends several bounds used to control the binomial tail to …

    washington Repository record for Finite Sampling Exponential Bounds (opens in a new tab)

  10. Tight Bernoulli tail probability bounds /

    … of the dissertation is to prove universal tight bounds for deviation from the mean probability inequalities for functions of random variables. Universal bounds shows that they are uniform with respect to some class of distributions and quantity of variables and other parameters. The bounds are …

    vilnius Repository record for Tight Bernoulli tail probability bounds / (opens in a new tab)

  11. Entropy bounds for glass networks

    … With our results and algorithm, using upper bounds on a Glass network’s symbolic representation’s entropy is now a viable method for assessing the irregularity of its dynamics.

    uvic Repository record for Entropy bounds for glass networks (opens in a new tab)

  12. Lower Bounds for Generalized Regulators

    … Skoruppa demonstrated a method to derive lower bounds for the relative regulator of an extension L/K of number fields. The relative regulator is defined using the subgroup of relative units of L/K. It appears in the theta series associated to this subgroup, so an inequality relating the theta …

    penn Repository record for Lower Bounds for Generalized Regulators (opens in a new tab)

  13. Precision bounds in localization microscopy

    This thesis presents two independent studies in theoretical and experimental optical imaging. The first part investigates the theoretical limits and simulation of Single-Pixel Localization Microscopy (SPLM), a computational imaging technique that employs spatio-temporally modulated (STM) …

    colostate Repository record for Precision bounds in localization microscopy (opens in a new tab)

  14. Improved stick number upper bounds

    … of knots, although theoretical and observed bounds exist. There is a natural correspondence between stick knots and polygons in R3. Previous research has attempted to improve observed stick number upper bounds by computationally generating such polygons and identifying the knots that they …

    colostate Repository record for Improved stick number upper bounds (opens in a new tab)

  15. Lower bounds in distributed computing

    … is well understood with tight upper and lower bounds. The connection with the maximum degree is much less well understood, with an exponential gap between the upper and lower bounds. We develop a new lower bound technique to give the first lower bound for a natural graph problem that is linear …

    aalto Repository record for Lower bounds in distributed computing (opens in a new tab)

  16. Upper bounds for cake cutting

    In this thesis we consider the well-studied cake cutting problem in which the goal is to find an envy-free allocation based on queries from $n$ agents. The problem has received attention in computer science, mathematics, and economics. It has been a major open problem whether there exists a …

    unsw Repository record for Upper bounds for cake cutting (opens in a new tab)

  17. On learning from lower bounds

    … known relationships between circuit lower bounds and algorithms for learning circuits. In particular, we present ways of converting Nisan's method of communication-complexity-based circuit lower bounds to algorithms for learning circuits with threshold gates. From this we obtain: A generic …

    bu Repository record for On learning from lower bounds (opens in a new tab)

  18. Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures

    … The main emphasis of this thesis is on lower bounds for time-space tradeoffs for the following problems: the rank/select problem, the problem of representing a string of balanced parentheses, the text retrieval problem, the problem of computing a permutation and its inverse, and the problem of …

    waterloo Repository record for Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures (opens in a new tab)

Page 1 of 370