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 11716 for “"Rank"”.

  1. Waring rank, Border rank and support concentration of partials

    … with minimal summands (also known as the Waring Rank of the polynomial) and related problems. The case of quadratic polynomials and binary forms was studied by Sylvester in his seminal paper in 1851 and the case for generic polynomials was resolved more than a century later by Alexander and …

    waterloo Repository record for Waring rank, Border rank and support concentration of partials (opens in a new tab)

  2. Το σύστημα RANK, RANK-L και οστεοπροτεγερίνης ως βιοδείκτης

    … του υποδοχέα του πυρηνικού παράγοντα κΒ (RANK-L), του ενεργοποιητή του υποδοχέα του πυρηνικού παράγοντα κΒ (RANK) και της οστεοπροτεγερίνης (OPG) αναγνωρίστηκε στα τέλη της δεκαετίας του 1990, στην προσπάθεια ταυτοποίησης των παραγόντων που ρυθμίζουν την οστεοκλαστογένεση. Σήμερα, ο ρόλος …

    athens Repository record for Το σύστημα RANK, RANK-L και οστεοπροτεγερίνης ως βιοδείκτης (opens in a new tab)

  3. Haemers' Minimum Rank

    <p>Haemers' minimum rank was first defined by Willem Haemers in 1979. He created this graph parameter as an upper bound for the Shannon capacity of a graph, and to answer some questions asked by Lovasz in his famous paper where he determined the Shannon capacity of a 5-cycle.</p> <p>In this thesis, …

    iastate Repository record for Haemers' Minimum Rank (opens in a new tab)

  4. Low-rank Matrix Estimation

    … regression models based on a low-rank constraint and an additional regularization for structured signals, with considerations of models of both continuous and binary responses. In the second part, we examine a Mixture Multilayer Stochastic Block Model (MMLSBM), where layers can be …

    ucf Repository record for Low-rank Matrix Estimation (opens in a new tab)

  5. Learning to Efficiently Rank

    … thesis describes the "Learning to Efficiently Rank" framework for building highly effective ranking models for Web-scale data, without sacrificing run-time efficiency for returning results. It introduces new classes of ranking models that have the capability of being simultaneously fast and …

    maryland Repository record for Learning to Efficiently Rank (opens in a new tab)

  6. Low rank phase retrieval

    <p>We study the Low Rank Phase Retrieval (LRPR) problem defined as follows: recover an $n \times q$ matrix $\Xstar$ of rank $r$ from a different and independent set of $m$ phaseless (magnitude-only) linear projections of each of its columns. To be precise, we need to recover $\Xstar$ from $\y_k := …

    iastate Repository record for Low rank phase retrieval (opens in a new tab)

  7. Principal rank characteristic sequences

    … <p>The first of these is the</p> <p>principal rank characteristic sequence</p> <p>(abbreviated pr-sequence).</p> <p>This sequence is defined as</p> <p>$r_0]r_1 \cdots r_n$,</p> <p>where, for $k \geq 1$,</p> <p>$r_k = 1$ if $B$ has a</p> <p>nonzero order-$k$ principal minor, and</p> <p>$r_k = …

    iastate Repository record for Principal rank characteristic sequences (opens in a new tab)

  8. Social rank and social anxiety

    … to investigate a primary assumption of social rank theory. More specifically, the purpose was to determine whether the perception of social inferiority leads to increased anxiety during social interaction, with a heightened effect occurring among those who are more socially anxious. Although …

    wvu Repository record for Social rank and social anxiety (opens in a new tab)

  9. Higher rank sieves and applications

    … primes. One such idea is the notion of higher rank sieve weights, first proposed by Atle Selberg and applied successfully to the context of prime k-tuples by J. Maynard and T. Tao. We develop an axiomatic formulation for a general higher rank sieve, in the spirit of Selberg's own treatment of …

    queens Repository record for Higher rank sieves and applications (opens in a new tab)

  10. Rank Reduction with Convex Constraints

    This thesis addresses problems which require low-rank solutions under convex constraints. In particular, the focus lies on model reduction of positive systems, as well as finite dimensional optimization problems that are convex, apart from a low-rank constraint. Traditional model reduction …

    lund Repository record for Rank Reduction with Convex Constraints (opens in a new tab) Download PDF for Rank Reduction with Convex Constraints (opens in a new tab)

  11. Adaptive Rank Quantum State Estimation

    Quantum state estimation is an important task in the realm of experimental quantum information science. While the common approaches to this task are generally adequate, the maximum-likelihood method is frequently used with parameterizations that do not strictly satisfy the statistical requirements …

    guelph Repository record for Adaptive Rank Quantum State Estimation (opens in a new tab)

  12. Computing the Rank of Braids

    We describe a method for computing rank (and determining quasipositivity) in the free group using dynamic programming. The algorithm is adapted to computing upper bounds on the rank for braids. We test our method on a table of knots by identifying quasipositive knots and calculating the ribbon …

    byu Repository record for Computing the Rank of Braids (opens in a new tab) Download PDF for Computing the Rank of Braids (opens in a new tab)

  13. Minimum Rank Problems for Cographs

    … corresponding to the edges of G. The smallest rank achieved by a matrix in S(G) is called the minimum rank of G, denoted mr(G). The maximum nullity achieved by a matrix in S(G) is denoted M(G). For each graph G, there is an associated minimum rank class, MR(G) consisting of all matrices A in …

    byu Repository record for Minimum Rank Problems for Cographs (opens in a new tab) Download PDF for Minimum Rank Problems for Cographs (opens in a new tab)

  14. Rank statistics of forecast ensembles

    … verifications is uniformity of the verification rank: If the verification falls between the (k-1)-st and k-th largest ensemble member it is said to have rank k. Statistical consistency implies that the average frequency of occurrence should be the same for each rank. A central result of the …

    qucosa-diss

  15. Median Rank in Face Recognition

    … we tried to use a variant of the Median Rank algorithm instead of current distance calculation methods. The Median Rank with normalized data returned better results, and in less time, than the best EBGM distance methods.

    reykjavik Repository record for Median Rank in Face Recognition (opens in a new tab)

  16. Three-manifolds of higher rank

    … have higher hyperbolic, Euclidean, or spherical rank if every geodesic admits a normal parallel field making curvature K with the geodesic. In this thesis, we establish rigidity results for three-manifolds of higher rank without a priori sectional curvature bounds. Complete finite volume …

    msu

  17. Rank regression in longitudinal data analysis

    An important problem that arises frequently in medical research is the analysis of data that arise from a repeated measures design. One of the distinctions of this design is dependencies among the data. Generally, there are a number of subjects that are assumed to be independent, and several …

    ttu Repository record for Rank regression in longitudinal data analysis (opens in a new tab)

Page 1 of 586