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 3688 for “"subset"”.

  1. Subset Selection via Spectral Objectives

    Selecting a small subset of items that captures key properties of a much larger data set is an important problem in a variety of areas, including machine learning, network design, and fair allocation of goods. We use a geometric model for this problem where the items (or their qualities) are …

    gatech Repository record for Subset Selection via Spectral Objectives (opens in a new tab)

  2. Subset comparatives as comparative quantifiers

    … motivates and presents a novel analysis of the "subset comparative" construction (e.g. John saw more phonologists than just Mary; John drank more than just coffee). I build on Hackl (2000) and Alxatib (2013)'s analyses of comparative quantifiers (more than three) to develop a unified account for …

    mit Repository record for Subset comparatives as comparative quantifiers (opens in a new tab)

  3. Metric Geometry of Finite Subset Spaces

    <p>If X is a (topological) space, the nth finite subset space of X, denoted by X(n), consists of n-point subsets of X (i.e., nonempty subsets of cardinality at most n) with the quotient topology induced by the unordering map q:X^n--> X(n), (x_1,...,x_n)-->{x_1,...,x_n}. That is, a subset A of X(n) …

    syracuse-diss Repository record for Metric Geometry of Finite Subset Spaces (opens in a new tab)

  4. Applications of balance optimization subset selection

    Balance Optimization Subset Selection (BOSS) is a framework designed to be used for causal inference on observational data. The theoretical foundation for the BOSS framework has been provided in the literature; this thesis aims to provide some examples of the practical value of BOSS by using it on …

    uiuc Repository record for Applications of balance optimization subset selection (opens in a new tab)

  5. Subset sums and other combinatorial results

    cambridge

  6. Modified Burg algorithms for multivariate subset autoregression

    … full set of lags, to multivariate modeling on a subset of lags. The key step in the algorithm involves minimizing the sum of the norm of the forward and backward prediction error residual vectors, as a function of the reflection coefficient matrices. We show that this sum has a global minimum, …

    colostate Repository record for Modified Burg algorithms for multivariate subset autoregression (opens in a new tab)

  7. Hamiltonian cycles in subset and subspace graphs.

    … Hamiltonicity and the uniform-Hamiltonicity of subset graphs, subspace graphs, and their associated bipartite graphs. In 1995 paper "The Subset-Subspace Analogy," Kung states the subspace version of a conjecture. The study of this problem led to a more general class of graphs. Inspired by Clark …

    unt Repository record for Hamiltonian cycles in subset and subspace graphs. (opens in a new tab)

  8. Lymphocyte subset variability between human lymphoid tissues

    … that there is local variation of B cell subsets between the tissues that are micro-anatomically different and receive antigenic stimulation via different routes. Matched samples of appendix, mesenteric lymph nodes (mLNs), and spleen from human cadaver were analysed by mass cytometry …

    cambridge Repository record for Lymphocyte subset variability between human lymphoid tissues (opens in a new tab)

  9. Pigeonhole Equal Subset Sum in O ⃰ (2ⁿ/³)

    Subset Sum is a well known NP-hard problem. In Subset Sum, we are given a set of n integers S = {a1,··· ,an} and a target integer t, and are asked to find a subset A ⊆ [n] such that [formula]. We study a variant of the Subset Sum problem, Pigeonhole Equal Subset Sum. In Pigeonhole Equal Subset Sum, …

    mit Repository record for Pigeonhole Equal Subset Sum in O ⃰ (2ⁿ/³) (opens in a new tab)

  10. Basis reduction algorithms and subset sum problems

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1991.

    mit Repository record for Basis reduction algorithms and subset sum problems (opens in a new tab)

  11. Algorithms for Subset Sum using linear sketching

    Given n positive integers, the Modular Subset Sum problem asks if a subset adds up to a given target t modulo a given integer m. This is a natural generalization of the Subset Sum problem (where m = + [infinity symbol]) with ties to additive combinatorics and cryptography. The non-modular case was …

    mit Repository record for Algorithms for Subset Sum using linear sketching (opens in a new tab)

  12. Transcription factor regulation of T helper subset function

    … immune responses. The development of specialized subsets of T helper cells is governed by transcription factors. Previous work demonstrated a requirement for the transcription factor PU.1 in the development of IL-9-secreting Th9 cells. Work in this dissertation demonstrates that the Th9 subset is …

    iupui Repository record for Transcription factor regulation of T helper subset function (opens in a new tab)

  13. On subset-sum-distinct sequences of positive integers

    "An SSD-sequence of integers is one in which each subset is uniquely determined by its sum. Such sequences are ""sparse"". Ryavec used a generating function technique to show that the sum of the reciprocals of the terms of such a sequence is at most two, and that the greedy algorithm generates the …

    uiuc Repository record for On subset-sum-distinct sequences of positive integers (opens in a new tab)

  14. Implementation of a structured PL/I subset compiler

    … the design and implementation of a PL/I subset compiler which produces a hypothetical stack code as output. The compiler was based on a Pascal compiler developed by N. Wirth and U. Amman of Eidgenössische Technische Hochschule, Zurich, and was itself written in the Pascal language. PL/I …

    cape-town Repository record for Implementation of a structured PL/I subset compiler (opens in a new tab)

  15. Subset Selection and Detection Problems in Opinion Dynamics Models

    L'abstract è presente nell'allegato / the abstract is in the attachment

    poli-torino Repository record for Subset Selection and Detection Problems in Opinion Dynamics Models (opens in a new tab)

  16. Subset sum and community problems: From social to geometry

    … positive integers and a target integer $u$, the subset sum problem is to decide if there is a subset of $S$ that sums up to $u$. We present a series of new algorithms that compute and return \emph{all} the realizable subset sums up to the integer $u$ in …

    uiuc Repository record for Subset sum and community problems: From social to geometry (opens in a new tab)

  17. Effects of a Simulated Tennis Match on Lymphocyte Subset Measurements

    … tennis match across two sessions on lymphocyte subsets. Initial measurements such as age, height, weight, skinfold analysis, and heart rate were recorded for each player, as well as blood samples being obtained by a finger prick before and after the tennis sessions. The tennis protocol started …

    wku-diss Repository record for Effects of a Simulated Tennis Match on Lymphocyte Subset Measurements (opens in a new tab)

Page 1 of 185